./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-17 09:40:53,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 09:40:53,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 09:40:53,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 09:40:53,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 09:40:53,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 09:40:53,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 09:40:53,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 09:40:53,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 09:40:53,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 09:40:53,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 09:40:53,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 09:40:53,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 09:40:53,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 09:40:53,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 09:40:53,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 09:40:53,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 09:40:53,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 09:40:53,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 09:40:53,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 09:40:53,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 09:40:53,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 09:40:53,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 09:40:53,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 09:40:53,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 09:40:53,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 09:40:53,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 09:40:53,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 09:40:53,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 09:40:53,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 09:40:53,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 09:40:53,954 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 09:40:53,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 09:40:53,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 09:40:53,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 09:40:53,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 09:40:53,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 09:40:53,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 09:40:53,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 09:40:53,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 09:40:53,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 09:40:53,964 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-17 09:40:53,998 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 09:40:53,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 09:40:53,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 09:40:53,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 09:40:54,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 09:40:54,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 09:40:54,001 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 09:40:54,002 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-17 09:40:54,002 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-17 09:40:54,002 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-17 09:40:54,003 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-17 09:40:54,003 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-17 09:40:54,003 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-17 09:40:54,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 09:40:54,004 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 09:40:54,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 09:40:54,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 09:40:54,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-17 09:40:54,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-17 09:40:54,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-17 09:40:54,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 09:40:54,005 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-17 09:40:54,005 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 09:40:54,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-17 09:40:54,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 09:40:54,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 09:40:54,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 09:40:54,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 09:40:54,007 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-17 09:40:54,008 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-17 09:40:54,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 09:40:54,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 09:40:54,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 09:40:54,334 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 09:40:54,335 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 09:40:54,337 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-17 09:40:55,635 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 09:40:55,847 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 09:40:55,847 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Ackermann01-1.c [2023-02-17 09:40:55,853 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c3f7aa2/3990e82ded1b481daa67ebf2d9a48c24/FLAGfc17f7e7b [2023-02-17 09:40:55,872 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1c3f7aa2/3990e82ded1b481daa67ebf2d9a48c24 [2023-02-17 09:40:55,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 09:40:55,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 09:40:55,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 09:40:55,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 09:40:55,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 09:40:55,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:40:55" (1/1) ... [2023-02-17 09:40:55,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174c5528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:55, skipping insertion in model container [2023-02-17 09:40:55,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:40:55" (1/1) ... [2023-02-17 09:40:55,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 09:40:55,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 09:40:56,019 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-17 09:40:56,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:40:56,031 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 09:40:56,042 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-17 09:40:56,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:40:56,056 INFO L208 MainTranslator]: Completed translation [2023-02-17 09:40:56,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56 WrapperNode [2023-02-17 09:40:56,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 09:40:56,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 09:40:56,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 09:40:56,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 09:40:56,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,084 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2023-02-17 09:40:56,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 09:40:56,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 09:40:56,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 09:40:56,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 09:40:56,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,096 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 09:40:56,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 09:40:56,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 09:40:56,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 09:40:56,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (1/1) ... [2023-02-17 09:40:56,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:56,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:56,131 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-17 09:40:56,133 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-17 09:40:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 09:40:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 09:40:56,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 09:40:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2023-02-17 09:40:56,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2023-02-17 09:40:56,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 09:40:56,215 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 09:40:56,217 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 09:40:56,359 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 09:40:56,365 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 09:40:56,365 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 09:40:56,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:40:56 BoogieIcfgContainer [2023-02-17 09:40:56,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 09:40:56,368 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-17 09:40:56,368 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-17 09:40:56,371 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-17 09:40:56,372 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:40:56,372 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.02 09:40:55" (1/3) ... [2023-02-17 09:40:56,373 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46321c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 09:40:56, skipping insertion in model container [2023-02-17 09:40:56,373 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:40:56,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:40:56" (2/3) ... [2023-02-17 09:40:56,374 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46321c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 09:40:56, skipping insertion in model container [2023-02-17 09:40:56,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-17 09:40:56,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:40:56" (3/3) ... [2023-02-17 09:40:56,375 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ackermann01-1.c [2023-02-17 09:40:56,433 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-17 09:40:56,434 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-17 09:40:56,434 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-17 09:40:56,434 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-17 09:40:56,434 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-17 09:40:56,434 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-17 09:40:56,434 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-17 09:40:56,435 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-17 09:40:56,439 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-17 09:40:56,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-17 09:40:56,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:40:56,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:40:56,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-17 09:40:56,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-17 09:40:56,514 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-17 09:40:56,515 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-17 09:40:56,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-17 09:40:56,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:40:56,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:40:56,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-17 09:40:56,534 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-17 09:40:56,542 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-17 09:40:56,543 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-17 09:40:56,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:56,557 INFO L85 PathProgramCache]: Analyzing trace with hash 28695872, now seen corresponding path program 1 times [2023-02-17 09:40:56,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:56,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879235888] [2023-02-17 09:40:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:56,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:56,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:40:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:56,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:40:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1697199, now seen corresponding path program 1 times [2023-02-17 09:40:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:56,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185434436] [2023-02-17 09:40:56,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:56,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:40:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:56,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:40:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:56,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1292962670, now seen corresponding path program 1 times [2023-02-17 09:40:56,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:56,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290180889] [2023-02-17 09:40:56,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:56,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:56,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:40:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:56,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:40:56,853 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:40:56,854 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:40:56,854 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:40:56,854 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:40:56,854 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:40:56,855 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:56,855 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:40:56,855 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:40:56,855 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration1_Loop [2023-02-17 09:40:56,855 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:40:56,856 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:40:56,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-17 09:40:56,876 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-17 09:40:56,877 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-17 09:40:56,878 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-17 09:40:56,880 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-17 09:40:56,881 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-17 09:40:56,882 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-17 09:40:56,884 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-17 09:40:56,896 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:40:56,897 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:40:56,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:56,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:56,923 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-17 09:40:56,989 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-17 09:40:56,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:56,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:57,017 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:57,017 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:40:57,025 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-17 09:40:57,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,027 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-17 09:40:57,030 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-17 09:40:57,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:57,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:57,049 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:57,049 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:40:57,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-02-17 09:40:57,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,057 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-17 09:40:57,059 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-17 09:40:57,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:57,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:57,082 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:57,082 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-17 09:40:57,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-17 09:40:57,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,090 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-17 09:40:57,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:57,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:57,114 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-17 09:40:57,116 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:57,116 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-17 09:40:57,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-02-17 09:40:57,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,133 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-17 09:40:57,134 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-17 09:40:57,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:57,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:57,146 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:57,146 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:40:57,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-02-17 09:40:57,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,150 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-17 09:40:57,152 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-17 09:40:57,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:57,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:57,169 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:57,169 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-17 09:40:57,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-02-17 09:40:57,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,175 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-17 09:40:57,177 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-17 09:40:57,179 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:57,179 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:57,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-02-17 09:40:57,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,194 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-17 09:40:57,196 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-17 09:40:57,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:40:57,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:57,226 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-17 09:40:57,229 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-17 09:40:57,230 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:40:57,230 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:40:57,230 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:40:57,230 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:40:57,230 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:40:57,230 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,230 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:40:57,230 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:40:57,230 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration1_Loop [2023-02-17 09:40:57,230 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:40:57,230 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:40:57,232 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-17 09:40:57,237 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-17 09:40:57,239 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-17 09:40:57,242 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-17 09:40:57,245 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-17 09:40:57,250 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-17 09:40:57,251 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-17 09:40:57,252 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-17 09:40:57,266 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:40:57,270 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:40:57,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,278 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-17 09:40:57,281 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-17 09:40:57,283 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-17 09:40:57,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:57,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:57,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:57,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:57,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:57,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:57,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:57,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:57,303 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-17 09:40:57,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,305 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-17 09:40:57,307 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-17 09:40:57,308 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-17 09:40:57,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:57,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:57,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:57,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:57,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:57,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:57,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:57,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:57,328 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-17 09:40:57,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,331 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-17 09:40:57,332 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-17 09:40:57,334 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-17 09:40:57,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:57,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:57,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:57,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:57,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:57,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:57,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:57,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:57,353 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-17 09:40:57,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,354 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-17 09:40:57,356 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-17 09:40:57,358 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-17 09:40:57,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:57,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:57,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:57,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:57,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:57,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:57,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:57,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:57,374 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-17 09:40:57,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,376 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-17 09:40:57,378 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-17 09:40:57,379 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-17 09:40:57,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:57,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:57,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:57,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:57,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:57,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:57,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:57,400 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:40:57,403 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-17 09:40:57,403 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-17 09:40:57,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,443 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-17 09:40:57,444 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-17 09:40:57,446 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:40:57,446 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-17 09:40:57,446 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:40:57,447 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = -2*ackermann_#in~n + 1 Supporting invariants [] [2023-02-17 09:40:57,455 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-17 09:40:57,457 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-17 09:40:57,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:40:57,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:40:57,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:40:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:40:57,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 09:40:57,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:40:57,564 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-17 09:40:57,593 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-17 09:40:57,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-02-17 09:40:57,605 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-17 09:40:57,686 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-17 09:40:57,688 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-17 09:40:57,693 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-17 09:40:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-17 09:40:57,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2023-02-17 09:40:57,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:40:57,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-17 09:40:57,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:40:57,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2023-02-17 09:40:57,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:40:57,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2023-02-17 09:40:57,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-17 09:40:57,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 29 states and 37 transitions. [2023-02-17 09:40:57,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-17 09:40:57,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-02-17 09:40:57,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-02-17 09:40:57,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:40:57,710 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-02-17 09:40:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-02-17 09:40:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2023-02-17 09:40:57,735 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-17 09:40:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-02-17 09:40:57,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-02-17 09:40:57,739 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-02-17 09:40:57,739 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-17 09:40:57,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2023-02-17 09:40:57,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-17 09:40:57,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:40:57,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:40:57,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:40:57,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-17 09:40:57,746 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-17 09:40:57,746 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-17 09:40:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash 180255807, now seen corresponding path program 1 times [2023-02-17 09:40:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:57,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519511376] [2023-02-17 09:40:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:57,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:40:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:57,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:40:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2259284, now seen corresponding path program 1 times [2023-02-17 09:40:57,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:57,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789090987] [2023-02-17 09:40:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:57,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:57,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:40:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:57,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:40:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046546, now seen corresponding path program 1 times [2023-02-17 09:40:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:57,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647293635] [2023-02-17 09:40:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:57,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:57,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:40:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:57,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:40:57,832 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:40:57,832 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:40:57,832 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:40:57,832 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:40:57,832 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:40:57,833 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,833 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:40:57,833 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:40:57,833 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration2_Loop [2023-02-17 09:40:57,833 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:40:57,833 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:40:57,834 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-17 09:40:57,836 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-17 09:40:57,837 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-17 09:40:57,838 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-17 09:40:57,839 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-17 09:40:57,840 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-17 09:40:57,844 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:40:57,845 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:40:57,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,847 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-17 09:40:57,854 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-17 09:40:57,856 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:57,857 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:57,872 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-17 09:40:57,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:57,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:57,874 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-17 09:40:57,875 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-17 09:40:57,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:40:57,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:58,262 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:58,263 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-17 09:40:58,268 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-17 09:40:58,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,269 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-17 09:40:58,270 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-17 09:40:58,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:58,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:58,282 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:58,282 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-17 09:40:58,291 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-17 09:40:58,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,292 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-17 09:40:58,294 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-17 09:40:58,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:58,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:58,303 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:58,303 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-17 09:40:58,306 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-17 09:40:58,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,308 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-17 09:40:58,309 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-17 09:40:58,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:58,311 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:58,318 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:58,318 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-17 09:40:58,321 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-17 09:40:58,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,322 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-17 09:40:58,324 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-17 09:40:58,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:58,325 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:58,338 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:58,338 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-17 09:40:58,343 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-17 09:40:58,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,344 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-17 09:40:58,347 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-17 09:40:58,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:58,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:58,356 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:58,356 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:40:58,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-02-17 09:40:58,372 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:40:58,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:40:58,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:40:58,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:40:58,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:40:58,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:40:58,373 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:40:58,373 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration2_Lasso [2023-02-17 09:40:58,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:40:58,373 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:40:58,375 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-17 09:40:58,376 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-17 09:40:58,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-17 09:40:58,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-17 09:40:58,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-17 09:40:58,397 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-17 09:40:58,411 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-17 09:40:58,412 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-17 09:40:58,413 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-17 09:40:58,414 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-17 09:40:58,414 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-17 09:40:58,415 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-17 09:40:58,416 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-17 09:40:58,417 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-17 09:40:58,417 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-17 09:40:58,418 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-17 09:40:58,419 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-17 09:40:58,420 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-17 09:40:58,422 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-17 09:40:58,423 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-17 09:40:58,433 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:40:58,433 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:40:58,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,435 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-17 09:40:58,446 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-17 09:40:58,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:58,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:58,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:58,456 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-17 09:40:58,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,479 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-17 09:40:58,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,481 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-17 09:40:58,489 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-17 09:40:58,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,504 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-17 09:40:58,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:58,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:58,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-02-17 09:40:58,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,541 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-17 09:40:58,543 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-17 09:40:58,545 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-17 09:40:58,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:58,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:58,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,582 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-17 09:40:58,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,584 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-17 09:40:58,589 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-17 09:40:58,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:58,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:58,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:58,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,600 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-17 09:40:58,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-02-17 09:40:58,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,604 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-17 09:40:58,606 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-17 09:40:58,607 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-17 09:40:58,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:58,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:58,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:58,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,633 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-17 09:40:58,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,634 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-17 09:40:58,643 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-17 09:40:58,645 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-17 09:40:58,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:58,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:58,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,678 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-17 09:40:58,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,680 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-17 09:40:58,683 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-17 09:40:58,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-17 09:40:58,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:58,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:58,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,719 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-17 09:40:58,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,721 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-17 09:40:58,729 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-17 09:40:58,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:58,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:58,744 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-17 09:40:58,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,765 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-17 09:40:58,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,767 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-17 09:40:58,770 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-17 09:40:58,771 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-17 09:40:58,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:58,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:58,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,803 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-17 09:40:58,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,805 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-17 09:40:58,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-17 09:40:58,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:58,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:58,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,836 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-17 09:40:58,840 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-17 09:40:58,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,842 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-17 09:40:58,845 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-17 09:40:58,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,855 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-17 09:40:58,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:58,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:58,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,884 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-17 09:40:58,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,886 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-17 09:40:58,897 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-17 09:40:58,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:58,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:58,911 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-17 09:40:58,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,924 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-17 09:40:58,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,926 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-17 09:40:58,928 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-17 09:40:58,930 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-17 09:40:58,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:58,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:58,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,963 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-17 09:40:58,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:58,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:58,965 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-17 09:40:58,967 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-17 09:40:58,968 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-17 09:40:58,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:58,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:58,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:58,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:58,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:58,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:58,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:58,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:58,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-02-17 09:40:58,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,001 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-17 09:40:59,004 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-17 09:40:59,005 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-17 09:40:59,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:59,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:59,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:59,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:59,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:59,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:59,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:59,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:59,031 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-17 09:40:59,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,033 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-17 09:40:59,034 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-17 09:40:59,037 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-17 09:40:59,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:59,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:59,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:59,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:59,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:59,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:59,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:59,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:59,052 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-17 09:40:59,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,053 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-17 09:40:59,055 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-17 09:40:59,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-17 09:40:59,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:59,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:59,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:59,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:59,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:59,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:59,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:59,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:59,085 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-17 09:40:59,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,087 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-17 09:40:59,096 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-17 09:40:59,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:59,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:59,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:59,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:59,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:59,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:59,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:59,106 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-17 09:40:59,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:59,116 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-17 09:40:59,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,117 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-17 09:40:59,125 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-17 09:40:59,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:59,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:59,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:59,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:59,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:59,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:59,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:59,143 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-17 09:40:59,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:59,163 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-17 09:40:59,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,166 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-17 09:40:59,168 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-17 09:40:59,170 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-17 09:40:59,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:59,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:59,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:59,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:59,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:59,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:59,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:59,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:59,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-17 09:40:59,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,206 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-17 09:40:59,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-17 09:40:59,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:59,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:59,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:59,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:59,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:59,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:59,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:59,219 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-17 09:40:59,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:59,245 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-17 09:40:59,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,246 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-17 09:40:59,253 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-17 09:40:59,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:59,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:59,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:59,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:59,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:40:59,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:40:59,265 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-17 09:40:59,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:59,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-02-17 09:40:59,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,274 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-17 09:40:59,276 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-17 09:40:59,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-17 09:40:59,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:59,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:40:59,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:40:59,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:40:59,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:59,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:40:59,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:40:59,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:40:59,307 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-17 09:40:59,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,308 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-17 09:40:59,313 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-17 09:40:59,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:40:59,321 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-02-17 09:40:59,321 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:40:59,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:40:59,331 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2023-02-17 09:40:59,332 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-17 09:40:59,340 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-17 09:40:59,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:40:59,371 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-02-17 09:40:59,371 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-02-17 09:40:59,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,373 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-17 09:40:59,375 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-17 09:40:59,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:40:59,384 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-17 09:40:59,384 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:40:59,384 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [2*ackermann_~n - 1 >= 0] [2023-02-17 09:40:59,387 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-17 09:40:59,391 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-17 09:40:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:40:59,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 09:40:59,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:40:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:40:59,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:40:59,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:40:59,487 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-17 09:40:59,488 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-17 09:40:59,488 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-17 09:40:59,537 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-17 09:40:59,538 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-17 09:40:59,539 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-17 09:40:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2023-02-17 09:40:59,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2023-02-17 09:40:59,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:40:59,540 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:40:59,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:40:59,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 09:40:59,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:40:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:40:59,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:40:59,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:40:59,622 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-17 09:40:59,623 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-17 09:40:59,623 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-17 09:40:59,717 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-17 09:40:59,718 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-17 09:40:59,719 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-17 09:40:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2023-02-17 09:40:59,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2023-02-17 09:40:59,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:40:59,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 12 letters. Loop has 4 letters. [2023-02-17 09:40:59,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:40:59,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2023-02-17 09:40:59,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:40:59,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 67 transitions. [2023-02-17 09:40:59,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-17 09:40:59,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 59 transitions. [2023-02-17 09:40:59,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-02-17 09:40:59,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-02-17 09:40:59,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. [2023-02-17 09:40:59,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:40:59,732 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-02-17 09:40:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. [2023-02-17 09:40:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2023-02-17 09:40:59,735 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-17 09:40:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-02-17 09:40:59,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-02-17 09:40:59,736 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-02-17 09:40:59,736 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-17 09:40:59,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2023-02-17 09:40:59,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-17 09:40:59,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:40:59,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:40:59,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:40:59,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-17 09:40:59,738 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-17 09:40:59,738 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-17 09:40:59,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:59,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046543, now seen corresponding path program 1 times [2023-02-17 09:40:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:59,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638823717] [2023-02-17 09:40:59,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:59,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:40:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:59,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:40:59,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2199699, now seen corresponding path program 2 times [2023-02-17 09:40:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:59,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15726623] [2023-02-17 09:40:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:59,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:40:59,792 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-17 09:40:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:40:59,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15726623] [2023-02-17 09:40:59,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15726623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:40:59,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:40:59,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:40:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678698688] [2023-02-17 09:40:59,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:40:59,795 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:40:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:40:59,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:40:59,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:40:59,798 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-17 09:40:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:40:59,827 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2023-02-17 09:40:59,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2023-02-17 09:40:59,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-02-17 09:40:59,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 61 transitions. [2023-02-17 09:40:59,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-02-17 09:40:59,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-02-17 09:40:59,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 61 transitions. [2023-02-17 09:40:59,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:40:59,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 61 transitions. [2023-02-17 09:40:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 61 transitions. [2023-02-17 09:40:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2023-02-17 09:40:59,833 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-17 09:40:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2023-02-17 09:40:59,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 60 transitions. [2023-02-17 09:40:59,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:40:59,835 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2023-02-17 09:40:59,835 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-17 09:40:59,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 60 transitions. [2023-02-17 09:40:59,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-02-17 09:40:59,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:40:59,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:40:59,837 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:40:59,837 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2023-02-17 09:40:59,837 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-17 09:40:59,837 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-17 09:40:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046543, now seen corresponding path program 2 times [2023-02-17 09:40:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:59,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675768134] [2023-02-17 09:40:59,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:59,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:40:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:59,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:40:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash -47204506, now seen corresponding path program 1 times [2023-02-17 09:40:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:59,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788496510] [2023-02-17 09:40:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:59,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:40:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:59,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:40:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:40:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2117341196, now seen corresponding path program 1 times [2023-02-17 09:40:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:40:59,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700899563] [2023-02-17 09:40:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:40:59,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:40:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:59,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:40:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:40:59,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:40:59,917 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:40:59,917 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:40:59,917 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:40:59,917 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:40:59,917 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:40:59,917 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,917 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:40:59,917 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:40:59,917 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration4_Loop [2023-02-17 09:40:59,918 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:40:59,918 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:40:59,918 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-17 09:40:59,919 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-17 09:40:59,920 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-17 09:40:59,921 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-17 09:40:59,922 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-17 09:40:59,923 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-17 09:40:59,926 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:40:59,926 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:40:59,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,927 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-17 09:40:59,929 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-17 09:40:59,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:59,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:59,957 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:59,957 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-17 09:40:59,961 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-17 09:40:59,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,965 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-17 09:40:59,967 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-17 09:40:59,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:59,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:59,976 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:59,977 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-17 09:40:59,979 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-17 09:40:59,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,980 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-17 09:40:59,982 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-17 09:40:59,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:40:59,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:40:59,993 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:40:59,993 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:40:59,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2023-02-17 09:40:59,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:40:59,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:40:59,997 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-17 09:41:00,005 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-17 09:41:00,009 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:00,009 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:00,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-02-17 09:41:00,018 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:00,018 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-17 09:41:00,021 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-17 09:41:00,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,023 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-17 09:41:00,024 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-17 09:41:00,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:00,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:00,049 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:00,049 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-17 09:41:00,053 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-17 09:41:00,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,054 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-17 09:41:00,054 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-17 09:41:00,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:00,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:00,073 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-17 09:41:00,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,074 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-17 09:41:00,076 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-17 09:41:00,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:41:00,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:00,352 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:00,352 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-17 09:41:00,356 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-17 09:41:00,367 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:41:00,368 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:41:00,368 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:41:00,368 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:41:00,368 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:41:00,368 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,368 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:41:00,368 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:41:00,368 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration4_Lasso [2023-02-17 09:41:00,369 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:41:00,369 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:41:00,370 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-17 09:41:00,385 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-17 09:41:00,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-17 09:41:00,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-17 09:41:00,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-17 09:41:00,398 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-17 09:41:00,399 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-17 09:41:00,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-17 09:41:00,401 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-17 09:41:00,402 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-17 09:41:00,404 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-17 09:41:00,404 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-17 09:41:00,405 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-17 09:41:00,406 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-17 09:41:00,407 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-17 09:41:00,407 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-17 09:41:00,411 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-17 09:41:00,415 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-17 09:41:00,416 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-17 09:41:00,418 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-17 09:41:00,437 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:41:00,438 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:41:00,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,441 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-17 09:41:00,451 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-17 09:41:00,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:00,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:00,472 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-17 09:41:00,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2023-02-17 09:41:00,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,478 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-17 09:41:00,479 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-17 09:41:00,481 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-17 09:41:00,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:00,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:00,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,512 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-17 09:41:00,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,514 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-17 09:41:00,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-17 09:41:00,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:00,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:00,533 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-17 09:41:00,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2023-02-17 09:41:00,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,542 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-17 09:41:00,544 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-17 09:41:00,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-17 09:41:00,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:00,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:00,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,571 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-17 09:41:00,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,572 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-17 09:41:00,577 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-17 09:41:00,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:00,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:00,589 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-17 09:41:00,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,605 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-17 09:41:00,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,606 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-17 09:41:00,613 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-17 09:41:00,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:00,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:00,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:00,623 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-17 09:41:00,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,632 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-17 09:41:00,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,634 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-17 09:41:00,637 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-17 09:41:00,638 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-17 09:41:00,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:00,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:00,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:00,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,664 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-17 09:41:00,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,666 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-17 09:41:00,668 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-17 09:41:00,670 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-17 09:41:00,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:00,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:00,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,728 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-17 09:41:00,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,730 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-17 09:41:00,732 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-17 09:41:00,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-17 09:41:00,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:00,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:00,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,760 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-17 09:41:00,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,763 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-17 09:41:00,770 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-17 09:41:00,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:00,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:00,781 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-17 09:41:00,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,797 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-17 09:41:00,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,798 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-17 09:41:00,801 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-17 09:41:00,802 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-17 09:41:00,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:00,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:00,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:00,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,830 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-17 09:41:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,831 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-17 09:41:00,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-17 09:41:00,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:00,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:00,854 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-17 09:41:00,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,878 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-17 09:41:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,880 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-17 09:41:00,883 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-17 09:41:00,884 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-17 09:41:00,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:00,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:00,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,911 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-17 09:41:00,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,913 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-17 09:41:00,917 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-17 09:41:00,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:00,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:00,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:00,927 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-17 09:41:00,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,945 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-17 09:41:00,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,946 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-17 09:41:00,948 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-17 09:41:00,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-17 09:41:00,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:00,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:00,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:00,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2023-02-17 09:41:00,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,977 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-17 09:41:00,979 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-17 09:41:00,980 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-17 09:41:00,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:00,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:00,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:00,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:00,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:00,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:00,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:00,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:00,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2023-02-17 09:41:00,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:00,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:00,992 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-17 09:41:00,997 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-17 09:41:00,997 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-17 09:41:01,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:01,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:01,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:01,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:01,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:01,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:01,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:01,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:01,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2023-02-17 09:41:01,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:01,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:01,010 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-17 09:41:01,010 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-17 09:41:01,013 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-17 09:41:01,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:01,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:01,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:01,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:01,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:01,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:01,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:01,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:01,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2023-02-17 09:41:01,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:01,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:01,029 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-17 09:41:01,031 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-17 09:41:01,033 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-17 09:41:01,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:01,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:01,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:01,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:01,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:01,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:01,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:01,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:01,077 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-17 09:41:01,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:01,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:01,078 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-17 09:41:01,081 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-17 09:41:01,082 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-17 09:41:01,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:01,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:01,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:01,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:01,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:01,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:01,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:01,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:01,114 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-17 09:41:01,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:01,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:01,116 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-17 09:41:01,121 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-17 09:41:01,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:01,129 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-02-17 09:41:01,130 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-02-17 09:41:01,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:01,150 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-17 09:41:01,171 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2023-02-17 09:41:01,172 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-02-17 09:41:01,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:41:01,288 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-02-17 09:41:01,288 INFO L444 ModelExtractionUtils]: 11 out of 28 variables were initially zero. Simplification set additionally 13 variables to zero. [2023-02-17 09:41:01,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:01,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:01,293 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-17 09:41:01,295 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-17 09:41:01,296 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:41:01,307 INFO L438 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2023-02-17 09:41:01,307 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:41:01,307 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [1*ackermann_~m - 1 >= 0] [2023-02-17 09:41:01,312 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-17 09:41:01,315 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-17 09:41:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:01,362 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-17 09:41:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:01,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 09:41:01,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:01,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 09:41:01,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:01,471 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-17 09:41:01,471 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-17 09:41:01,472 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-17 09:41:01,557 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-17 09:41:01,558 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-17 09:41:01,560 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-17 09:41:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2023-02-17 09:41:01,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 12 letters. Loop has 8 letters. [2023-02-17 09:41:01,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:01,561 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:41:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:01,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 09:41:01,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:01,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 09:41:01,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:01,675 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-17 09:41:01,676 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-17 09:41:01,676 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-17 09:41:01,854 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-17 09:41:01,854 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-17 09:41:01,855 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-17 09:41:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2023-02-17 09:41:01,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 12 letters. Loop has 8 letters. [2023-02-17 09:41:01,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:01,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 20 letters. Loop has 8 letters. [2023-02-17 09:41:01,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:01,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 12 letters. Loop has 16 letters. [2023-02-17 09:41:01,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:01,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 223 transitions. [2023-02-17 09:41:01,860 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2023-02-17 09:41:01,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 115 states and 180 transitions. [2023-02-17 09:41:01,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2023-02-17 09:41:01,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2023-02-17 09:41:01,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2023-02-17 09:41:01,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:01,865 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 180 transitions. [2023-02-17 09:41:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2023-02-17 09:41:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2023-02-17 09:41:01,880 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-17 09:41:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 175 transitions. [2023-02-17 09:41:01,881 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 175 transitions. [2023-02-17 09:41:01,881 INFO L428 stractBuchiCegarLoop]: Abstraction has 110 states and 175 transitions. [2023-02-17 09:41:01,882 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-17 09:41:01,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 175 transitions. [2023-02-17 09:41:01,883 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2023-02-17 09:41:01,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:01,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:01,884 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:41:01,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-17 09:41:01,885 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-17 09:41:01,885 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-17 09:41:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:01,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1511844440, now seen corresponding path program 1 times [2023-02-17 09:41:01,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:01,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015298685] [2023-02-17 09:41:01,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:01,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:41:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:02,029 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-17 09:41:02,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:02,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015298685] [2023-02-17 09:41:02,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015298685] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:02,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171432303] [2023-02-17 09:41:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:02,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:02,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,032 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-17 09:41:02,038 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-17 09:41:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:02,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 09:41:02,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:02,082 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-17 09:41:02,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:41:02,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171432303] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:41:02,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:41:02,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2023-02-17 09:41:02,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046329355] [2023-02-17 09:41:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:41:02,084 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:41:02,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1697294, now seen corresponding path program 2 times [2023-02-17 09:41:02,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:02,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100205921] [2023-02-17 09:41:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:02,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:02,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:02,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:02,093 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:41:02,094 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:41:02,094 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:41:02,094 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:41:02,094 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:41:02,094 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,094 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:41:02,094 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:41:02,094 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration5_Loop [2023-02-17 09:41:02,095 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:41:02,095 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:41:02,095 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-17 09:41:02,096 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-17 09:41:02,097 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-17 09:41:02,098 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-17 09:41:02,098 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-17 09:41:02,099 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-17 09:41:02,100 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-17 09:41:02,101 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-17 09:41:02,103 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:41:02,103 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:41:02,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,105 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-17 09:41:02,116 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-17 09:41:02,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,124 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,125 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:41:02,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2023-02-17 09:41:02,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,129 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-17 09:41:02,131 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-17 09:41:02,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2023-02-17 09:41:02,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,144 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-17 09:41:02,146 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-17 09:41:02,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:41:02,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,170 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,170 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-17 09:41:02,175 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-17 09:41:02,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,176 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-17 09:41:02,177 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-17 09:41:02,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,217 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,217 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:41:02,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2023-02-17 09:41:02,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,221 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-17 09:41:02,228 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-17 09:41:02,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,244 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,244 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-17 09:41:02,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2023-02-17 09:41:02,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,248 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-17 09:41:02,249 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-17 09:41:02,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,252 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,259 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,259 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-17 09:41:02,262 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-17 09:41:02,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,263 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-17 09:41:02,265 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-17 09:41:02,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,274 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,274 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:41:02,277 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-17 09:41:02,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,278 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-17 09:41:02,280 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-17 09:41:02,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,294 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,294 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-17 09:41:02,297 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-17 09:41:02,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,298 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-17 09:41:02,299 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-17 09:41:02,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,337 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,338 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-17 09:41:02,341 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-17 09:41:02,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:41:02,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:41:02,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:41:02,342 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-17 09:41:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:41:02,388 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2023-02-17 09:41:02,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 111 transitions. [2023-02-17 09:41:02,389 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-17 09:41:02,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 76 states and 105 transitions. [2023-02-17 09:41:02,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2023-02-17 09:41:02,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2023-02-17 09:41:02,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 105 transitions. [2023-02-17 09:41:02,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:02,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 105 transitions. [2023-02-17 09:41:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 105 transitions. [2023-02-17 09:41:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-17 09:41:02,396 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-17 09:41:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2023-02-17 09:41:02,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 105 transitions. [2023-02-17 09:41:02,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 09:41:02,398 INFO L428 stractBuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2023-02-17 09:41:02,398 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-17 09:41:02,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. [2023-02-17 09:41:02,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-17 09:41:02,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:02,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:02,399 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:41:02,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-17 09:41:02,400 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-17 09:41:02,400 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-17 09:41:02,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash -376751137, now seen corresponding path program 2 times [2023-02-17 09:41:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:02,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343673811] [2023-02-17 09:41:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:02,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:02,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:02,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:02,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2009294, now seen corresponding path program 3 times [2023-02-17 09:41:02,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:02,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66547207] [2023-02-17 09:41:02,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:02,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:02,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:02,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:02,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2009908652, now seen corresponding path program 3 times [2023-02-17 09:41:02,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:02,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854936455] [2023-02-17 09:41:02,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:02,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:02,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:02,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:02,466 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:41:02,466 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:41:02,466 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:41:02,467 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:41:02,467 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:41:02,467 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,467 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:41:02,467 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:41:02,467 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration6_Loop [2023-02-17 09:41:02,467 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:41:02,467 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:41:02,469 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-17 09:41:02,470 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-17 09:41:02,471 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-17 09:41:02,471 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-17 09:41:02,472 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-17 09:41:02,473 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-17 09:41:02,475 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:41:02,476 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:41:02,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,477 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-17 09:41:02,481 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-17 09:41:02,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,488 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,489 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:41:02,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2023-02-17 09:41:02,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,492 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-17 09:41:02,495 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-17 09:41:02,495 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,495 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,503 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,503 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-17 09:41:02,513 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-17 09:41:02,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,515 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-17 09:41:02,517 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-17 09:41:02,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,525 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,526 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-17 09:41:02,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2023-02-17 09:41:02,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,530 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-17 09:41:02,531 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-17 09:41:02,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,533 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,549 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-17 09:41:02,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,550 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-17 09:41:02,552 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-17 09:41:02,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:41:02,553 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,891 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,891 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-17 09:41:02,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2023-02-17 09:41:02,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,896 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-17 09:41:02,897 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-17 09:41:02,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,913 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,913 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-17 09:41:02,916 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-17 09:41:02,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:02,917 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-17 09:41:02,918 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-17 09:41:02,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:02,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:02,957 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:02,958 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-17 09:41:02,961 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-17 09:41:02,981 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:41:02,982 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:41:02,982 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:41:02,982 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:41:02,982 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:41:02,982 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:02,982 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:41:02,982 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:41:02,982 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration6_Lasso [2023-02-17 09:41:02,982 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:41:02,982 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:41:02,984 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-17 09:41:02,985 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-17 09:41:02,992 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-17 09:41:02,993 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-17 09:41:02,994 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-17 09:41:02,995 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-17 09:41:02,995 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-17 09:41:02,996 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-17 09:41:02,997 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-17 09:41:02,998 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-17 09:41:02,998 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-17 09:41:02,999 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-17 09:41:03,000 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-17 09:41:03,001 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-17 09:41:03,002 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-17 09:41:03,005 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-17 09:41:03,006 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-17 09:41:03,007 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-17 09:41:03,008 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-17 09:41:03,018 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-17 09:41:03,019 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-17 09:41:03,025 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:41:03,025 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:41:03,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,054 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-17 09:41:03,056 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-17 09:41:03,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-17 09:41:03,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,065 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-02-17 09:41:03,065 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:41:03,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,076 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2023-02-17 09:41:03,077 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-17 09:41:03,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,101 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-17 09:41:03,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,102 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-17 09:41:03,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-17 09:41:03,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:03,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:03,122 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-17 09:41:03,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,137 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-17 09:41:03,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,139 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-17 09:41:03,141 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-17 09:41:03,143 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-17 09:41:03,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:03,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:03,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,180 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-17 09:41:03,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,182 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-17 09:41:03,185 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-17 09:41:03,185 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-17 09:41:03,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:03,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:03,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,217 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-17 09:41:03,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,218 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-17 09:41:03,225 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-17 09:41:03,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:03,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:03,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:03,235 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-17 09:41:03,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,246 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-17 09:41:03,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,248 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-17 09:41:03,250 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-17 09:41:03,251 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-17 09:41:03,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:03,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,260 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:03,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:03,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,280 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-17 09:41:03,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,282 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-17 09:41:03,284 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-17 09:41:03,286 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-17 09:41:03,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:03,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:03,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:03,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,316 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-17 09:41:03,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,318 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-17 09:41:03,325 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-17 09:41:03,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:03,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:03,338 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-17 09:41:03,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,352 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-17 09:41:03,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,353 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-17 09:41:03,356 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-17 09:41:03,359 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-17 09:41:03,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:03,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:03,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,388 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-17 09:41:03,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,390 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-17 09:41:03,393 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-17 09:41:03,394 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-17 09:41:03,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:03,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:03,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:03,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,420 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-17 09:41:03,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,422 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-17 09:41:03,424 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-17 09:41:03,426 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-17 09:41:03,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:03,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:03,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:03,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2023-02-17 09:41:03,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,455 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-17 09:41:03,461 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-17 09:41:03,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:03,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:03,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:03,471 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-17 09:41:03,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,484 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-17 09:41:03,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,486 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-17 09:41:03,488 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-17 09:41:03,490 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-17 09:41:03,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:03,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:03,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:03,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,520 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-17 09:41:03,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,522 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-17 09:41:03,525 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-17 09:41:03,527 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-17 09:41:03,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:03,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:03,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:03,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2023-02-17 09:41:03,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,545 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-17 09:41:03,545 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-17 09:41:03,548 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-17 09:41:03,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:03,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:03,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:03,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,558 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-17 09:41:03,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,559 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-17 09:41:03,562 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-17 09:41:03,562 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-17 09:41:03,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:03,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:03,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,600 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-17 09:41:03,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,601 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-17 09:41:03,602 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-17 09:41:03,604 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-17 09:41:03,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:03,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:03,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2023-02-17 09:41:03,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,620 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-17 09:41:03,620 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-17 09:41:03,623 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-17 09:41:03,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:03,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:03,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:03,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:03,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2023-02-17 09:41:03,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,639 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-17 09:41:03,648 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-17 09:41:03,649 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-17 09:41:03,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:03,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:03,655 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:41:03,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:03,661 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-02-17 09:41:03,661 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-17 09:41:03,676 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:41:03,689 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-02-17 09:41:03,689 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-02-17 09:41:03,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:03,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:03,692 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-17 09:41:03,692 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-17 09:41:03,693 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:41:03,704 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-17 09:41:03,705 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:41:03,705 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [1*ackermann_~n >= 0] [2023-02-17 09:41:03,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2023-02-17 09:41:03,714 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-17 09:41:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:03,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:41:03,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:03,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:41:03,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:03,833 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-17 09:41:03,834 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-17 09:41:03,834 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-17 09:41:03,855 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-17 09:41:03,861 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-17 09:41:03,861 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-17 09:41:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-17 09:41:03,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 4 letters. [2023-02-17 09:41:03,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:03,862 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:41:03,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:03,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:41:03,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:03,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:41:03,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:03,954 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-17 09:41:03,955 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-17 09:41:03,955 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-17 09:41:03,974 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-17 09:41:03,975 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-17 09:41:03,976 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-17 09:41:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-17 09:41:03,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 4 letters. [2023-02-17 09:41:03,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:03,977 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:41:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:04,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:41:04,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:04,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:41:04,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:04,087 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-17 09:41:04,089 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-17 09:41:04,091 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-17 09:41:04,200 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-17 09:41:04,205 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-17 09:41:04,206 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-17 09:41:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2023-02-17 09:41:04,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 15 letters. Loop has 4 letters. [2023-02-17 09:41:04,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:04,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 19 letters. Loop has 4 letters. [2023-02-17 09:41:04,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:04,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 15 letters. Loop has 8 letters. [2023-02-17 09:41:04,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:04,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 230 transitions. [2023-02-17 09:41:04,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2023-02-17 09:41:04,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 113 states and 162 transitions. [2023-02-17 09:41:04,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2023-02-17 09:41:04,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-02-17 09:41:04,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 162 transitions. [2023-02-17 09:41:04,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:04,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 162 transitions. [2023-02-17 09:41:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 162 transitions. [2023-02-17 09:41:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2023-02-17 09:41:04,237 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-17 09:41:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2023-02-17 09:41:04,240 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 150 transitions. [2023-02-17 09:41:04,240 INFO L428 stractBuchiCegarLoop]: Abstraction has 108 states and 150 transitions. [2023-02-17 09:41:04,241 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-17 09:41:04,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 150 transitions. [2023-02-17 09:41:04,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-17 09:41:04,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:04,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:04,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:41:04,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:41:04,245 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-17 09:41:04,246 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-17 09:41:04,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:04,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2142297082, now seen corresponding path program 1 times [2023-02-17 09:41:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:04,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790095341] [2023-02-17 09:41:04,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:04,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:04,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:04,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:04,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1250092377, now seen corresponding path program 1 times [2023-02-17 09:41:04,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:04,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301260588] [2023-02-17 09:41:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:04,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:04,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:04,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1017421986, now seen corresponding path program 1 times [2023-02-17 09:41:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:04,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891754120] [2023-02-17 09:41:04,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:04,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:41:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:04,382 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-17 09:41:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:04,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 09:41:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:04,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:04,438 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-17 09:41:04,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:04,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891754120] [2023-02-17 09:41:04,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891754120] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:04,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615069733] [2023-02-17 09:41:04,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:04,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:04,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:04,441 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-17 09:41:04,463 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-17 09:41:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:04,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 09:41:04,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:04,533 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-17 09:41:04,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:04,615 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-17 09:41:04,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615069733] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:04,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:04,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-02-17 09:41:04,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298135732] [2023-02-17 09:41:04,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:04,623 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:41:04,624 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:41:04,624 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:41:04,624 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:41:04,624 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:41:04,624 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:04,624 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:41:04,624 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:41:04,624 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration7_Loop [2023-02-17 09:41:04,625 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:41:04,625 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:41:04,625 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-17 09:41:04,626 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-17 09:41:04,627 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-17 09:41:04,627 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-17 09:41:04,628 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-17 09:41:04,631 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:41:04,631 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:41:04,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:04,633 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-17 09:41:04,635 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-17 09:41:04,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:04,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:04,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:04,665 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:41:04,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2023-02-17 09:41:04,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:04,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:04,671 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-17 09:41:04,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:04,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:04,686 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-17 09:41:04,692 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:04,692 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-17 09:41:04,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2023-02-17 09:41:04,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:04,696 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-17 09:41:04,697 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-17 09:41:04,699 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:04,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:04,706 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:04,706 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-17 09:41:04,708 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-17 09:41:04,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:04,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:04,710 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-17 09:41:04,711 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-17 09:41:04,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:04,712 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:04,730 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-17 09:41:04,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:04,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:04,731 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-17 09:41:04,731 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-17 09:41:04,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:41:04,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:05,889 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-17 09:41:05,895 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-17 09:41:05,895 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:41:05,895 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:41:05,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:41:05,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:41:05,895 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:41:05,895 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:05,895 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:41:05,895 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:41:05,895 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration7_Loop [2023-02-17 09:41:05,895 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:41:05,895 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:41:05,896 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-17 09:41:05,897 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-17 09:41:05,897 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-17 09:41:05,898 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-17 09:41:05,899 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-17 09:41:05,901 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:41:05,901 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:41:05,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:05,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:05,903 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-17 09:41:05,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-17 09:41:05,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:05,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:05,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:05,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:05,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:05,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:05,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:05,923 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-17 09:41:05,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:05,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2023-02-17 09:41:05,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:05,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:05,936 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-17 09:41:05,936 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-17 09:41:05,938 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-17 09:41:05,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:05,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:05,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:05,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:05,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:05,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:05,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:05,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:05,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2023-02-17 09:41:05,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:05,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:05,950 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-17 09:41:05,951 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-17 09:41:05,952 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-17 09:41:05,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:05,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:05,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:05,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:05,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:05,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:05,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:05,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:05,962 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-17 09:41:05,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:05,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:05,963 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-17 09:41:05,964 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-17 09:41:05,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-17 09:41:05,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:05,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:05,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:05,972 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:41:05,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:05,974 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-17 09:41:05,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:05,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:41:05,979 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-17 09:41:05,979 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-17 09:41:05,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:05,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:05,981 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-17 09:41:05,982 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-17 09:41:05,983 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:41:05,983 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-17 09:41:05,984 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:41:05,984 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [] [2023-02-17 09:41:05,986 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-17 09:41:05,987 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-17 09:41:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:06,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 09:41:06,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:06,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 09:41:06,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:06,128 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-17 09:41:06,129 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-17 09:41:06,129 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-17 09:41:06,222 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-17 09:41:06,222 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-17 09:41:06,223 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-17 09:41:06,223 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-17 09:41:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2023-02-17 09:41:06,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 20 letters. Loop has 16 letters. [2023-02-17 09:41:06,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:06,226 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:41:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:06,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 09:41:06,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:06,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 09:41:06,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:06,355 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-17 09:41:06,356 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-17 09:41:06,356 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-17 09:41:06,508 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-17 09:41:06,509 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-17 09:41:06,509 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-17 09:41:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2023-02-17 09:41:06,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 16 letters. [2023-02-17 09:41:06,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:06,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 36 letters. Loop has 16 letters. [2023-02-17 09:41:06,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:06,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 32 letters. [2023-02-17 09:41:06,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:06,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 409 transitions. [2023-02-17 09:41:06,515 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2023-02-17 09:41:06,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 222 states and 347 transitions. [2023-02-17 09:41:06,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2023-02-17 09:41:06,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2023-02-17 09:41:06,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 347 transitions. [2023-02-17 09:41:06,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:06,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 347 transitions. [2023-02-17 09:41:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 347 transitions. [2023-02-17 09:41:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2023-02-17 09:41:06,533 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-17 09:41:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 327 transitions. [2023-02-17 09:41:06,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209 states and 327 transitions. [2023-02-17 09:41:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:41:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 09:41:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-17 09:41:06,537 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-17 09:41:06,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:41:06,698 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2023-02-17 09:41:06,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 364 transitions. [2023-02-17 09:41:06,701 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2023-02-17 09:41:06,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 230 states and 362 transitions. [2023-02-17 09:41:06,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2023-02-17 09:41:06,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2023-02-17 09:41:06,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 362 transitions. [2023-02-17 09:41:06,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:06,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 362 transitions. [2023-02-17 09:41:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 362 transitions. [2023-02-17 09:41:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2023-02-17 09:41:06,733 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-17 09:41:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 351 transitions. [2023-02-17 09:41:06,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 223 states and 351 transitions. [2023-02-17 09:41:06,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 09:41:06,737 INFO L428 stractBuchiCegarLoop]: Abstraction has 223 states and 351 transitions. [2023-02-17 09:41:06,737 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-17 09:41:06,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 351 transitions. [2023-02-17 09:41:06,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2023-02-17 09:41:06,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:06,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:06,741 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-17 09:41:06,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-17 09:41:06,741 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-17 09:41:06,741 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-17 09:41:06,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1132004457, now seen corresponding path program 2 times [2023-02-17 09:41:06,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:06,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610474540] [2023-02-17 09:41:06,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:06,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:41:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:06,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:06,889 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-17 09:41:06,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:06,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610474540] [2023-02-17 09:41:06,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610474540] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:06,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355467704] [2023-02-17 09:41:06,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:41:06,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:06,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:06,892 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-17 09:41:06,912 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-17 09:41:06,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:41:06,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:06,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 09:41:06,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:06,970 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-17 09:41:06,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:07,010 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-17 09:41:07,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355467704] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:07,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:07,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 9 [2023-02-17 09:41:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771856370] [2023-02-17 09:41:07,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:07,011 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:41:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2259284, now seen corresponding path program 4 times [2023-02-17 09:41:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:07,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662749710] [2023-02-17 09:41:07,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:07,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:07,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:07,019 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:41:07,019 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:41:07,019 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:41:07,019 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:41:07,019 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:41:07,019 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:07,019 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:41:07,020 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:41:07,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration8_Loop [2023-02-17 09:41:07,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:41:07,020 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:41:07,021 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-17 09:41:07,021 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-17 09:41:07,022 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-17 09:41:07,023 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-17 09:41:07,023 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-17 09:41:07,024 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-17 09:41:07,027 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:41:07,027 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:41:07,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:07,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:07,028 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-17 09:41:07,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:07,038 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:07,046 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-17 09:41:07,057 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:07,057 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-17 09:41:07,061 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-17 09:41:07,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:07,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:07,062 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-17 09:41:07,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:07,073 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:07,082 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-17 09:41:07,093 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:07,093 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-17 09:41:07,097 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-17 09:41:07,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:07,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:07,099 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-17 09:41:07,104 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-17 09:41:07,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:07,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:07,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2023-02-17 09:41:07,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:07,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:07,146 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-17 09:41:07,149 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-17 09:41:07,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:41:07,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:07,332 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:07,332 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-17 09:41:07,335 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-17 09:41:07,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:07,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:07,336 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-17 09:41:07,338 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-17 09:41:07,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:07,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:07,346 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:07,346 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:41:07,349 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-17 09:41:07,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:07,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:07,351 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-17 09:41:07,351 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-17 09:41:07,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:07,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:07,361 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:07,361 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-17 09:41:07,363 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-17 09:41:07,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:07,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:07,365 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-17 09:41:07,366 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-17 09:41:07,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:07,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:07,380 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:07,380 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-17 09:41:07,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2023-02-17 09:41:07,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:41:07,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 09:41:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:41:07,385 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-17 09:41:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:41:07,456 INFO L93 Difference]: Finished difference Result 169 states and 264 transitions. [2023-02-17 09:41:07,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 264 transitions. [2023-02-17 09:41:07,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-17 09:41:07,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 161 states and 238 transitions. [2023-02-17 09:41:07,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2023-02-17 09:41:07,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2023-02-17 09:41:07,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 238 transitions. [2023-02-17 09:41:07,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:07,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 161 states and 238 transitions. [2023-02-17 09:41:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 238 transitions. [2023-02-17 09:41:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2023-02-17 09:41:07,467 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-17 09:41:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2023-02-17 09:41:07,468 INFO L240 hiAutomatonCegarLoop]: Abstraction has 155 states and 215 transitions. [2023-02-17 09:41:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 09:41:07,469 INFO L428 stractBuchiCegarLoop]: Abstraction has 155 states and 215 transitions. [2023-02-17 09:41:07,469 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-17 09:41:07,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 215 transitions. [2023-02-17 09:41:07,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-17 09:41:07,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:07,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:07,476 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-17 09:41:07,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 11, 9, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2] [2023-02-17 09:41:07,477 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-17 09:41:07,477 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-17 09:41:07,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2019866079, now seen corresponding path program 1 times [2023-02-17 09:41:07,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:07,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679299725] [2023-02-17 09:41:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:07,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 09:41:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,588 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-17 09:41:07,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:07,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679299725] [2023-02-17 09:41:07,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679299725] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:07,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882492680] [2023-02-17 09:41:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:07,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:07,590 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-17 09:41:07,621 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-17 09:41:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 09:41:07,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:07,701 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-17 09:41:07,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:07,757 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-17 09:41:07,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882492680] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:07,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:07,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-02-17 09:41:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432157000] [2023-02-17 09:41:07,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:07,763 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:41:07,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:07,763 INFO L85 PathProgramCache]: Analyzing trace with hash -431501854, now seen corresponding path program 1 times [2023-02-17 09:41:07,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:07,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107580951] [2023-02-17 09:41:07,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:07,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 09:41:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:07,941 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-17 09:41:07,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:07,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107580951] [2023-02-17 09:41:07,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107580951] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:07,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083984362] [2023-02-17 09:41:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:07,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:07,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:07,949 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-17 09:41:07,968 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-17 09:41:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 09:41:08,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:08,035 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-17 09:41:08,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:08,081 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-17 09:41:08,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083984362] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:08,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:08,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-02-17 09:41:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752359164] [2023-02-17 09:41:08,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:08,083 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:41:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:41:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 09:41:08,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-17 09:41:08,084 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-17 09:41:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:41:08,172 INFO L93 Difference]: Finished difference Result 135 states and 191 transitions. [2023-02-17 09:41:08,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 191 transitions. [2023-02-17 09:41:08,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2023-02-17 09:41:08,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 130 states and 186 transitions. [2023-02-17 09:41:08,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2023-02-17 09:41:08,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2023-02-17 09:41:08,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 186 transitions. [2023-02-17 09:41:08,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:08,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 186 transitions. [2023-02-17 09:41:08,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 186 transitions. [2023-02-17 09:41:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2023-02-17 09:41:08,181 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-17 09:41:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2023-02-17 09:41:08,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 138 transitions. [2023-02-17 09:41:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 09:41:08,183 INFO L428 stractBuchiCegarLoop]: Abstraction has 107 states and 138 transitions. [2023-02-17 09:41:08,183 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-17 09:41:08,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 138 transitions. [2023-02-17 09:41:08,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2023-02-17 09:41:08,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:08,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:08,187 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-17 09:41:08,187 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3] [2023-02-17 09:41:08,187 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-17 09:41:08,189 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-17 09:41:08,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1100790060, now seen corresponding path program 2 times [2023-02-17 09:41:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:08,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260450418] [2023-02-17 09:41:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:08,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:08,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:08,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:08,219 INFO L85 PathProgramCache]: Analyzing trace with hash -119431079, now seen corresponding path program 2 times [2023-02-17 09:41:08,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:08,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687118568] [2023-02-17 09:41:08,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:08,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 09:41:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:08,670 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-17 09:41:08,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:08,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687118568] [2023-02-17 09:41:08,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687118568] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:08,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797767601] [2023-02-17 09:41:08,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:41:08,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:08,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:08,674 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-17 09:41:08,675 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-17 09:41:08,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:41:08,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:08,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 09:41:08,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:08,831 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-17 09:41:08,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:09,188 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-17 09:41:09,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797767601] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:09,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:09,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 15] total 32 [2023-02-17 09:41:09,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309920576] [2023-02-17 09:41:09,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:09,189 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:41:09,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:41:09,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-17 09:41:09,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2023-02-17 09:41:09,191 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-17 09:41:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:41:09,875 INFO L93 Difference]: Finished difference Result 148 states and 200 transitions. [2023-02-17 09:41:09,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 200 transitions. [2023-02-17 09:41:09,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-17 09:41:09,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 147 states and 193 transitions. [2023-02-17 09:41:09,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2023-02-17 09:41:09,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2023-02-17 09:41:09,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 193 transitions. [2023-02-17 09:41:09,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:09,880 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 193 transitions. [2023-02-17 09:41:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 193 transitions. [2023-02-17 09:41:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2023-02-17 09:41:09,884 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-17 09:41:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2023-02-17 09:41:09,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 175 transitions. [2023-02-17 09:41:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-17 09:41:09,887 INFO L428 stractBuchiCegarLoop]: Abstraction has 133 states and 175 transitions. [2023-02-17 09:41:09,887 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-17 09:41:09,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 175 transitions. [2023-02-17 09:41:09,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-17 09:41:09,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:09,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:09,889 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-17 09:41:09,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-17 09:41:09,889 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-17 09:41:09,889 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-17 09:41:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:09,890 INFO L85 PathProgramCache]: Analyzing trace with hash -235246462, now seen corresponding path program 3 times [2023-02-17 09:41:09,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:09,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82000912] [2023-02-17 09:41:09,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:09,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:09,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:09,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1697294, now seen corresponding path program 5 times [2023-02-17 09:41:09,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:09,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926870278] [2023-02-17 09:41:09,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:09,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:09,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:09,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1578641935, now seen corresponding path program 4 times [2023-02-17 09:41:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:09,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229852678] [2023-02-17 09:41:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:09,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:09,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:09,932 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:41:09,933 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:41:09,933 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:41:09,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:41:09,933 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-17 09:41:09,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:09,933 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:41:09,933 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:41:09,933 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration11_Loop [2023-02-17 09:41:09,933 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:41:09,934 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:41:09,934 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-17 09:41:09,935 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-17 09:41:09,936 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-17 09:41:09,937 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-17 09:41:09,937 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-17 09:41:09,938 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-17 09:41:09,939 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-17 09:41:09,939 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-17 09:41:09,941 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:41:09,941 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-17 09:41:09,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:09,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:09,945 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-17 09:41:09,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:09,954 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:09,962 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-17 09:41:09,977 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:09,977 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-17 09:41:09,982 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-17 09:41:09,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:09,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:09,985 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-17 09:41:09,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:09,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:10,008 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-17 09:41:10,014 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:10,014 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-17 09:41:10,017 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-17 09:41:10,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,019 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-17 09:41:10,020 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-17 09:41:10,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:10,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:10,028 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:10,028 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:41:10,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2023-02-17 09:41:10,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,033 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-17 09:41:10,034 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-17 09:41:10,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:10,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:10,043 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:10,043 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:41:10,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2023-02-17 09:41:10,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,047 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-17 09:41:10,048 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-17 09:41:10,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:10,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:10,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2023-02-17 09:41:10,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,060 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-17 09:41:10,062 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-17 09:41:10,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-17 09:41:10,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:10,084 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:10,084 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-17 09:41:10,087 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-17 09:41:10,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,088 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-17 09:41:10,089 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-17 09:41:10,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:10,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:10,099 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:10,099 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-17 09:41:10,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2023-02-17 09:41:10,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,103 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-17 09:41:10,104 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-17 09:41:10,106 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:10,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:10,113 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:10,113 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-17 09:41:10,115 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-17 09:41:10,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,117 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-17 09:41:10,128 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-17 09:41:10,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-17 09:41:10,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-17 09:41:10,135 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-17 09:41:10,136 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-17 09:41:10,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2023-02-17 09:41:10,162 INFO L210 LassoAnalysis]: Preferences: [2023-02-17 09:41:10,163 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-17 09:41:10,163 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-17 09:41:10,163 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-17 09:41:10,163 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-17 09:41:10,163 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,163 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-17 09:41:10,164 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-17 09:41:10,164 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration11_Lasso [2023-02-17 09:41:10,164 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-17 09:41:10,164 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-17 09:41:10,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-17 09:41:10,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-17 09:41:10,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-17 09:41:10,177 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-17 09:41:10,178 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-17 09:41:10,178 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-17 09:41:10,179 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-17 09:41:10,180 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-17 09:41:10,181 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-17 09:41:10,182 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-17 09:41:10,183 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-17 09:41:10,184 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-17 09:41:10,184 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-17 09:41:10,185 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-17 09:41:10,186 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-17 09:41:10,187 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-17 09:41:10,189 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-17 09:41:10,189 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-17 09:41:10,200 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-17 09:41:10,202 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-17 09:41:10,202 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-17 09:41:10,209 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-17 09:41:10,209 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-17 09:41:10,216 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-17 09:41:10,216 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-17 09:41:10,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,218 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-17 09:41:10,225 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-17 09:41:10,225 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-17 09:41:10,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:10,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:10,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:10,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:10,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:10,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:10,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:10,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:10,235 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-17 09:41:10,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,237 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-17 09:41:10,239 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-17 09:41:10,241 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-17 09:41:10,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:10,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:10,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:10,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:10,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:10,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:10,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:10,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2023-02-17 09:41:10,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,255 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-17 09:41:10,256 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-17 09:41:10,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-17 09:41:10,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:10,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:10,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:10,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:10,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:10,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:10,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:10,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2023-02-17 09:41:10,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,272 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-17 09:41:10,274 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-17 09:41:10,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-17 09:41:10,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:10,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:10,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:10,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:10,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-17 09:41:10,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-17 09:41:10,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:10,288 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-17 09:41:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,289 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-17 09:41:10,290 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-17 09:41:10,292 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-17 09:41:10,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:10,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:10,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:10,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:10,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:10,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:10,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:10,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:10,302 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-17 09:41:10,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,304 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-17 09:41:10,305 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-17 09:41:10,307 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-17 09:41:10,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:10,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:10,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:10,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:10,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:10,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:10,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:10,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:10,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2023-02-17 09:41:10,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,318 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-17 09:41:10,320 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-17 09:41:10,322 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-17 09:41:10,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:10,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:10,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:10,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:10,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:10,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:10,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:10,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:10,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2023-02-17 09:41:10,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,334 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-17 09:41:10,335 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-17 09:41:10,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-17 09:41:10,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:10,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:10,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:10,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:10,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:10,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:10,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:10,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:10,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2023-02-17 09:41:10,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,348 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-17 09:41:10,349 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-17 09:41:10,351 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-17 09:41:10,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:10,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-17 09:41:10,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:10,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-17 09:41:10,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:10,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-17 09:41:10,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-17 09:41:10,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-17 09:41:10,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2023-02-17 09:41:10,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,362 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-17 09:41:10,364 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-17 09:41:10,365 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-17 09:41:10,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-17 09:41:10,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-17 09:41:10,372 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-17 09:41:10,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-17 09:41:10,375 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-02-17 09:41:10,375 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-17 09:41:10,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-17 09:41:10,401 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-02-17 09:41:10,401 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-02-17 09:41:10,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-17 09:41:10,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:10,404 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-17 09:41:10,404 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-17 09:41:10,405 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-17 09:41:10,414 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-17 09:41:10,414 INFO L513 LassoAnalysis]: Proved termination. [2023-02-17 09:41:10,415 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-17 09:41:10,419 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-17 09:41:10,422 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-17 09:41:10,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:10,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 09:41:10,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:10,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:41:10,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:10,665 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-17 09:41:10,666 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-17 09:41:10,666 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-17 09:41:10,799 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-17 09:41:10,898 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-17 09:41:10,899 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-17 09:41:10,900 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-17 09:41:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2023-02-17 09:41:10,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 40 letters. Loop has 4 letters. [2023-02-17 09:41:10,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:10,900 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:41:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:10,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 09:41:10,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:11,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:41:11,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:11,116 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-17 09:41:11,116 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-17 09:41:11,117 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-17 09:41:11,312 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-17 09:41:11,313 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-17 09:41:11,314 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-17 09:41:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2023-02-17 09:41:11,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 40 letters. Loop has 4 letters. [2023-02-17 09:41:11,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:11,314 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-17 09:41:11,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:11,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 09:41:11,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:11,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 09:41:11,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:11,558 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-17 09:41:11,558 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-17 09:41:11,559 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-17 09:41:11,946 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-17 09:41:11,946 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-17 09:41:11,947 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-17 09:41:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2023-02-17 09:41:11,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 40 letters. Loop has 4 letters. [2023-02-17 09:41:11,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:11,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 44 letters. Loop has 4 letters. [2023-02-17 09:41:11,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:11,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 40 letters. Loop has 8 letters. [2023-02-17 09:41:11,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-17 09:41:11,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 282 transitions. [2023-02-17 09:41:11,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2023-02-17 09:41:11,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 174 states and 228 transitions. [2023-02-17 09:41:11,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2023-02-17 09:41:11,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2023-02-17 09:41:11,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 228 transitions. [2023-02-17 09:41:11,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:11,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 228 transitions. [2023-02-17 09:41:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 228 transitions. [2023-02-17 09:41:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 152. [2023-02-17 09:41:11,959 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-17 09:41:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 191 transitions. [2023-02-17 09:41:11,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 191 transitions. [2023-02-17 09:41:11,960 INFO L428 stractBuchiCegarLoop]: Abstraction has 152 states and 191 transitions. [2023-02-17 09:41:11,960 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-17 09:41:11,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 191 transitions. [2023-02-17 09:41:11,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2023-02-17 09:41:11,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:11,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:11,963 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-17 09:41:11,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 11, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3] [2023-02-17 09:41:11,965 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-17 09:41:11,965 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-17 09:41:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:11,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1984234175, now seen corresponding path program 5 times [2023-02-17 09:41:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:11,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638305124] [2023-02-17 09:41:11,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:11,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 09:41:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,380 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-17 09:41:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:12,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638305124] [2023-02-17 09:41:12,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638305124] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:12,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733305712] [2023-02-17 09:41:12,381 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 09:41:12,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:12,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:12,385 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-17 09:41:12,387 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-17 09:41:12,478 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-17 09:41:12,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:12,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 09:41:12,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:12,550 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-17 09:41:12,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:12,826 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-17 09:41:12,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733305712] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:12,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:12,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 26 [2023-02-17 09:41:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527213958] [2023-02-17 09:41:12,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:12,828 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:41:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1263997516, now seen corresponding path program 3 times [2023-02-17 09:41:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:12,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280363738] [2023-02-17 09:41:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:41:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:13,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:13,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:13,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:13,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:13,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:13,179 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-17 09:41:13,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:13,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280363738] [2023-02-17 09:41:13,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280363738] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:13,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878980735] [2023-02-17 09:41:13,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 09:41:13,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:13,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:13,182 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-17 09:41:13,204 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-17 09:41:13,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-17 09:41:13,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:13,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 09:41:13,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:13,367 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-17 09:41:13,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:13,614 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-17 09:41:13,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878980735] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:13,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:13,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 26 [2023-02-17 09:41:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186457858] [2023-02-17 09:41:13,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:13,615 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:41:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:41:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 09:41:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2023-02-17 09:41:13,617 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-17 09:41:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:41:13,974 INFO L93 Difference]: Finished difference Result 189 states and 258 transitions. [2023-02-17 09:41:13,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 258 transitions. [2023-02-17 09:41:13,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2023-02-17 09:41:13,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 173 states and 232 transitions. [2023-02-17 09:41:13,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2023-02-17 09:41:13,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2023-02-17 09:41:13,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 232 transitions. [2023-02-17 09:41:13,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:13,980 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 232 transitions. [2023-02-17 09:41:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 232 transitions. [2023-02-17 09:41:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2023-02-17 09:41:13,985 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-17 09:41:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2023-02-17 09:41:13,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 158 states and 202 transitions. [2023-02-17 09:41:13,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 09:41:13,987 INFO L428 stractBuchiCegarLoop]: Abstraction has 158 states and 202 transitions. [2023-02-17 09:41:13,987 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-17 09:41:13,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 202 transitions. [2023-02-17 09:41:13,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2023-02-17 09:41:13,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:13,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:13,990 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-17 09:41:13,990 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 13, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4] [2023-02-17 09:41:13,990 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-17 09:41:13,990 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-17 09:41:13,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2095171192, now seen corresponding path program 6 times [2023-02-17 09:41:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:13,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473344346] [2023-02-17 09:41:13,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:13,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:41:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,444 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-17 09:41:14,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:14,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473344346] [2023-02-17 09:41:14,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473344346] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:14,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438297640] [2023-02-17 09:41:14,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 09:41:14,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:14,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:14,449 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-17 09:41:14,471 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-17 09:41:14,590 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2023-02-17 09:41:14,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:14,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 09:41:14,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:14,643 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-17 09:41:14,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:14,900 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-17 09:41:14,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438297640] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:14,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:14,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2023-02-17 09:41:14,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748700878] [2023-02-17 09:41:14,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:14,902 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:41:14,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash -869926651, now seen corresponding path program 4 times [2023-02-17 09:41:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:14,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413536373] [2023-02-17 09:41:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 09:41:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:15,318 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-17 09:41:15,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:15,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413536373] [2023-02-17 09:41:15,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413536373] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:15,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301241473] [2023-02-17 09:41:15,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 09:41:15,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:15,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:15,325 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-17 09:41:15,344 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-17 09:41:15,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 09:41:15,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:15,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 09:41:15,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:15,534 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-17 09:41:15,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:15,796 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-17 09:41:15,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301241473] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:15,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:15,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2023-02-17 09:41:15,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840216038] [2023-02-17 09:41:15,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:15,797 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:41:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:41:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 09:41:15,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2023-02-17 09:41:15,798 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-17 09:41:16,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:41:16,128 INFO L93 Difference]: Finished difference Result 202 states and 280 transitions. [2023-02-17 09:41:16,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 280 transitions. [2023-02-17 09:41:16,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-02-17 09:41:16,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 186 states and 254 transitions. [2023-02-17 09:41:16,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2023-02-17 09:41:16,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2023-02-17 09:41:16,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 254 transitions. [2023-02-17 09:41:16,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:16,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 254 transitions. [2023-02-17 09:41:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 254 transitions. [2023-02-17 09:41:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2023-02-17 09:41:16,144 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-17 09:41:16,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 223 transitions. [2023-02-17 09:41:16,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 223 transitions. [2023-02-17 09:41:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 09:41:16,146 INFO L428 stractBuchiCegarLoop]: Abstraction has 170 states and 223 transitions. [2023-02-17 09:41:16,147 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-17 09:41:16,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 223 transitions. [2023-02-17 09:41:16,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2023-02-17 09:41:16,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:16,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:16,152 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-17 09:41:16,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [59, 58, 35, 24, 24, 24, 24, 24, 23, 23, 11, 11, 11, 11] [2023-02-17 09:41:16,153 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-17 09:41:16,154 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-17 09:41:16,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash 478890302, now seen corresponding path program 7 times [2023-02-17 09:41:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:16,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297277937] [2023-02-17 09:41:16,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:16,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:16,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:41:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:41:16,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:41:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash 888511461, now seen corresponding path program 5 times [2023-02-17 09:41:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:16,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046014484] [2023-02-17 09:41:16,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:16,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:16,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 09:41:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:41:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:17,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:41:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-02-17 09:41:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-02-17 09:41:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:18,576 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-17 09:41:18,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:18,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046014484] [2023-02-17 09:41:18,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046014484] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:18,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133325812] [2023-02-17 09:41:18,577 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 09:41:18,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:18,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:18,581 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-17 09:41:18,603 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-17 09:41:18,815 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-02-17 09:41:18,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:18,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-17 09:41:18,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:19,086 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-17 09:41:19,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:20,134 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-17 09:41:20,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133325812] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:20,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:20,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 28] total 49 [2023-02-17 09:41:20,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941395228] [2023-02-17 09:41:20,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:20,137 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:41:20,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:41:20,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-17 09:41:20,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2151, Unknown=0, NotChecked=0, Total=2352 [2023-02-17 09:41:20,139 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-17 09:41:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:41:22,359 INFO L93 Difference]: Finished difference Result 312 states and 453 transitions. [2023-02-17 09:41:22,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 453 transitions. [2023-02-17 09:41:22,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2023-02-17 09:41:22,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 283 states and 396 transitions. [2023-02-17 09:41:22,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2023-02-17 09:41:22,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234 [2023-02-17 09:41:22,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 283 states and 396 transitions. [2023-02-17 09:41:22,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:22,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 283 states and 396 transitions. [2023-02-17 09:41:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states and 396 transitions. [2023-02-17 09:41:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 241. [2023-02-17 09:41:22,383 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-17 09:41:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 318 transitions. [2023-02-17 09:41:22,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 241 states and 318 transitions. [2023-02-17 09:41:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-02-17 09:41:22,386 INFO L428 stractBuchiCegarLoop]: Abstraction has 241 states and 318 transitions. [2023-02-17 09:41:22,386 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-17 09:41:22,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 318 transitions. [2023-02-17 09:41:22,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-02-17 09:41:22,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:22,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:22,395 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-17 09:41:22,395 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [66, 64, 39, 27, 27, 27, 27, 27, 26, 26, 12, 12, 11, 11] [2023-02-17 09:41:22,396 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-17 09:41:22,397 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-17 09:41:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1815337676, now seen corresponding path program 8 times [2023-02-17 09:41:22,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:22,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721647247] [2023-02-17 09:41:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:22,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 09:41:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:23,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:23,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:23,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:41:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:41:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-02-17 09:41:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-02-17 09:41:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:24,764 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-17 09:41:24,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:24,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721647247] [2023-02-17 09:41:24,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721647247] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:24,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022975307] [2023-02-17 09:41:24,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:41:24,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:24,773 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-17 09:41:24,795 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-17 09:41:25,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:41:25,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:25,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 09:41:25,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:25,288 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-17 09:41:25,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:25,704 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-17 09:41:25,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022975307] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:25,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:25,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 12, 16] total 43 [2023-02-17 09:41:25,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601650627] [2023-02-17 09:41:25,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:25,706 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:41:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash 41962951, now seen corresponding path program 6 times [2023-02-17 09:41:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:25,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409132095] [2023-02-17 09:41:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:41:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:41:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:41:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-02-17 09:41:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-02-17 09:41:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:28,094 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-17 09:41:28,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:28,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409132095] [2023-02-17 09:41:28,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409132095] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:28,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618641393] [2023-02-17 09:41:28,095 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 09:41:28,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:28,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:28,101 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-17 09:41:28,123 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-17 09:41:28,515 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2023-02-17 09:41:28,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:28,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-17 09:41:28,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:28,643 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-17 09:41:28,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:29,627 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-17 09:41:29,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618641393] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:29,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:29,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 29] total 35 [2023-02-17 09:41:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926660455] [2023-02-17 09:41:29,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:29,629 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:41:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:41:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-17 09:41:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1023, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 09:41:29,631 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-17 09:41:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:41:30,302 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2023-02-17 09:41:30,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 427 transitions. [2023-02-17 09:41:30,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2023-02-17 09:41:30,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 291 states and 401 transitions. [2023-02-17 09:41:30,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2023-02-17 09:41:30,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2023-02-17 09:41:30,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 291 states and 401 transitions. [2023-02-17 09:41:30,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:30,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 291 states and 401 transitions. [2023-02-17 09:41:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 401 transitions. [2023-02-17 09:41:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 257. [2023-02-17 09:41:30,319 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-17 09:41:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 346 transitions. [2023-02-17 09:41:30,321 INFO L240 hiAutomatonCegarLoop]: Abstraction has 257 states and 346 transitions. [2023-02-17 09:41:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-17 09:41:30,322 INFO L428 stractBuchiCegarLoop]: Abstraction has 257 states and 346 transitions. [2023-02-17 09:41:30,322 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-17 09:41:30,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 346 transitions. [2023-02-17 09:41:30,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-17 09:41:30,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:30,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:30,330 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-17 09:41:30,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [88, 87, 50, 38, 38, 38, 38, 38, 37, 37, 12, 12, 12, 12] [2023-02-17 09:41:30,330 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-17 09:41:30,331 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-17 09:41:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash 301299634, now seen corresponding path program 9 times [2023-02-17 09:41:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:30,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750144114] [2023-02-17 09:41:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:30,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:30,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:41:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:31,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:41:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-02-17 09:41:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-02-17 09:41:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-02-17 09:41:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-17 09:41:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:32,302 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-17 09:41:32,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:32,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750144114] [2023-02-17 09:41:32,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750144114] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:32,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337764003] [2023-02-17 09:41:32,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 09:41:32,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:32,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:32,309 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-17 09:41:32,334 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-17 09:41:32,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2023-02-17 09:41:32,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:32,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-17 09:41:32,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:33,143 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-17 09:41:33,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:35,322 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-17 09:41:35,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337764003] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:35,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:35,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 28, 39] total 57 [2023-02-17 09:41:35,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723941080] [2023-02-17 09:41:35,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:35,324 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:41:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2130492481, now seen corresponding path program 7 times [2023-02-17 09:41:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:35,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977413833] [2023-02-17 09:41:35,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:37,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 09:41:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:42,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:41:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-02-17 09:41:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-02-17 09:41:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-02-17 09:41:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-17 09:41:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:47,897 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-17 09:41:47,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:47,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977413833] [2023-02-17 09:41:47,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977413833] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:47,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852441902] [2023-02-17 09:41:47,898 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 09:41:47,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:47,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:47,900 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-17 09:41:47,901 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-17 09:41:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:48,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-17 09:41:48,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:48,666 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-17 09:41:48,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:49,474 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-17 09:41:49,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852441902] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:49,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:49,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17, 24] total 43 [2023-02-17 09:41:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654725765] [2023-02-17 09:41:49,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:49,476 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:41:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:41:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-17 09:41:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1607, Unknown=0, NotChecked=0, Total=1806 [2023-02-17 09:41:49,478 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-17 09:41:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:41:50,270 INFO L93 Difference]: Finished difference Result 354 states and 525 transitions. [2023-02-17 09:41:50,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 525 transitions. [2023-02-17 09:41:50,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2023-02-17 09:41:50,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 343 states and 507 transitions. [2023-02-17 09:41:50,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 282 [2023-02-17 09:41:50,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2023-02-17 09:41:50,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 343 states and 507 transitions. [2023-02-17 09:41:50,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-17 09:41:50,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 343 states and 507 transitions. [2023-02-17 09:41:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states and 507 transitions. [2023-02-17 09:41:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 282. [2023-02-17 09:41:50,289 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-17 09:41:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 366 transitions. [2023-02-17 09:41:50,290 INFO L240 hiAutomatonCegarLoop]: Abstraction has 282 states and 366 transitions. [2023-02-17 09:41:50,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-17 09:41:50,291 INFO L428 stractBuchiCegarLoop]: Abstraction has 282 states and 366 transitions. [2023-02-17 09:41:50,291 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-02-17 09:41:50,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 366 transitions. [2023-02-17 09:41:50,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-17 09:41:50,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-17 09:41:50,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-17 09:41:50,332 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-17 09:41:50,332 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1341, 1340, 747, 594, 594, 594, 594, 594, 593, 593, 153, 153, 153, 153] [2023-02-17 09:41:50,333 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-17 09:41:50,338 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-17 09:41:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:50,341 INFO L85 PathProgramCache]: Analyzing trace with hash -630874818, now seen corresponding path program 10 times [2023-02-17 09:41:50,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:50,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201412101] [2023-02-17 09:41:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:41:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:50,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-17 09:41:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:50,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:41:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:41:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:41:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:41:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:41:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:41:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:41:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:41:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:41:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:41:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:41:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:41:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:41:51,719 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-17 09:41:51,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:41:51,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201412101] [2023-02-17 09:41:51,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201412101] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:41:51,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940974509] [2023-02-17 09:41:51,719 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 09:41:51,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:41:51,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:41:51,722 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-17 09:41:51,723 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-17 09:41:52,520 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 09:41:52,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:41:52,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 09:41:52,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:41:52,601 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-17 09:41:52,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:41:52,824 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-17 09:41:52,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940974509] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:41:52,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:41:52,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 20 [2023-02-17 09:41:52,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436626076] [2023-02-17 09:41:52,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:41:52,826 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-17 09:41:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:41:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1588779923, now seen corresponding path program 8 times [2023-02-17 09:41:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:41:52,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580458486] [2023-02-17 09:41:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:41:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:42:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:42:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 09:42:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:42:57,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:19,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:43:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:20,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:21,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:21,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-17 09:43:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:27,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:33,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:43:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-17 09:43:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 921 [2023-02-17 09:43:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1330 [2023-02-17 09:43:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1739 [2023-02-17 09:43:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2148 [2023-02-17 09:43:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:40,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3073 [2023-02-17 09:43:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:41,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:42,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:42,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:43:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-17 09:43:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 921 [2023-02-17 09:43:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:43,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1330 [2023-02-17 09:43:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1739 [2023-02-17 09:43:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:44,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2148 [2023-02-17 09:43:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:45,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5634 [2023-02-17 09:43:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:47,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:47,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-17 09:43:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-17 09:43:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 921 [2023-02-17 09:43:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1330 [2023-02-17 09:43:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1739 [2023-02-17 09:43:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2148 [2023-02-17 09:43:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 09:43:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 09:43:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-17 09:43:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-17 09:43:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-17 09:43:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 09:43:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 09:43:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 09:43:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 09:43:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-17 09:43:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 09:43:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:43:50,210 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-17 09:43:50,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:43:50,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580458486] [2023-02-17 09:43:50,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580458486] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:43:50,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459293988] [2023-02-17 09:43:50,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:43:50,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:43:50,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:43:50,215 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-17 09:43:50,216 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-17 09:43:54,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 09:43:54,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:43:54,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 22947 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-17 09:43:54,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:43:55,037 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-17 09:43:55,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:43:59,305 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-17 09:43:59,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459293988] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:43:59,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:43:59,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28, 39] total 62 [2023-02-17 09:43:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861203605] [2023-02-17 09:43:59,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:43:59,315 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-17 09:43:59,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:43:59,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 09:43:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-02-17 09:43:59,316 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-17 09:43:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:43:59,502 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2023-02-17 09:43:59,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 211 transitions. [2023-02-17 09:43:59,503 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-17 09:43:59,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 0 states and 0 transitions. [2023-02-17 09:43:59,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-17 09:43:59,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-17 09:43:59,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-17 09:43:59,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-17 09:43:59,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 09:43:59,504 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 09:43:59,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 09:43:59,505 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 09:43:59,505 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-02-17 09:43:59,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-02-17 09:43:59,505 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-17 09:43:59,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-02-17 09:43:59,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 09:43:59 BoogieIcfgContainer [2023-02-17 09:43:59,519 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-17 09:43:59,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 09:43:59,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 09:43:59,520 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 09:43:59,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:40:56" (3/4) ... [2023-02-17 09:43:59,523 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-17 09:43:59,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 09:43:59,523 INFO L158 Benchmark]: Toolchain (without parser) took 183646.67ms. Allocated memory was 113.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 81.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-02-17 09:43:59,523 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 113.2MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:43:59,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.23ms. Allocated memory is still 113.2MB. Free memory was 80.9MB in the beginning and 71.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 09:43:59,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.36ms. Allocated memory is still 113.2MB. Free memory was 71.0MB in the beginning and 69.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:43:59,524 INFO L158 Benchmark]: Boogie Preprocessor took 13.67ms. Allocated memory is still 113.2MB. Free memory was 69.9MB in the beginning and 68.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 09:43:59,524 INFO L158 Benchmark]: RCFGBuilder took 268.01ms. Allocated memory is still 113.2MB. Free memory was 68.9MB in the beginning and 59.4MB in the end (delta: 9.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-17 09:43:59,525 INFO L158 Benchmark]: BuchiAutomizer took 183151.52ms. Allocated memory was 113.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 58.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-02-17 09:43:59,525 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 3.7GB. Free memory is still 2.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:43:59,526 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.21ms. Allocated memory is still 113.2MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.23ms. Allocated memory is still 113.2MB. Free memory was 80.9MB in the beginning and 71.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.36ms. Allocated memory is still 113.2MB. Free memory was 71.0MB in the beginning and 69.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.67ms. Allocated memory is still 113.2MB. Free memory was 69.9MB in the beginning and 68.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 268.01ms. Allocated memory is still 113.2MB. Free memory was 68.9MB in the beginning and 59.4MB in the end (delta: 9.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 183151.52ms. Allocated memory was 113.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 58.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 3.7GB. Free memory is still 2.2GB. 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 183.0s and 18 iterations. TraceHistogramMax:1341. Analysis of lassos took 173.2s. Construction of modules took 3.2s. Büchi inclusion checks took 6.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 17. Automata minimization 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 280 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.1s 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.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1345 mSDsluCounter, 2141 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1687 mSDsCounter, 2096 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5392 IncrementalHoareTripleChecker+Invalid, 7488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2096 mSolverCounterUnsat, 454 mSDtfsCounter, 5392 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: 192ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 43 LassoNonterminationAnalysisSatUnbounded: 6 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-02-17 09:43:59,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Ended with exit code 0 [2023-02-17 09:43:59,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Ended with exit code 0 [2023-02-17 09:43:59,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Ended with exit code 0 [2023-02-17 09:44:00,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Ended with exit code 0 [2023-02-17 09:44:00,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Ended with exit code 0 [2023-02-17 09:44:00,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Ended with exit code 0 [2023-02-17 09:44:00,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Ended with exit code 0 [2023-02-17 09:44:00,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Ended with exit code 0 [2023-02-17 09:44:01,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Ended with exit code 0 [2023-02-17 09:44:01,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Forceful destruction successful, exit code 0 [2023-02-17 09:44:01,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Forceful destruction successful, exit code 0 [2023-02-17 09:44:01,765 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-17 09:44:01,965 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-17 09:44:02,165 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-17 09:44:02,366 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-17 09:44:02,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2023-02-17 09:44:02,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2023-02-17 09:44:02,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE