./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/recursified_loop-simple/recursified_nested_6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 16:07:01,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 16:07:01,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 16:07:01,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 16:07:01,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 16:07:01,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 16:07:01,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 16:07:01,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 16:07:01,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 16:07:01,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 16:07:01,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 16:07:01,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 16:07:01,619 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 16:07:01,619 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 16:07:01,620 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 16:07:01,620 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 16:07:01,620 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 16:07:01,620 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 16:07:01,621 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 16:07:01,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 16:07:01,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 16:07:01,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 16:07:01,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 16:07:01,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 16:07:01,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 16:07:01,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 16:07:01,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 16:07:01,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 16:07:01,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 16:07:01,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 16:07:01,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 16:07:01,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 16:07:01,629 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 16:07:01,630 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 16:07:01,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 16:07:01,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 16:07:01,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 16:07:01,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 16:07:01,631 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 16:07:01,631 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2024-11-09 16:07:01,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 16:07:01,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 16:07:01,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 16:07:01,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 16:07:01,895 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 16:07:01,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-11-09 16:07:03,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 16:07:03,609 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 16:07:03,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-11-09 16:07:03,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ada7055a/c1b933ce7bbe4425b85e985ed68266f9/FLAG5003886a3 [2024-11-09 16:07:03,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ada7055a/c1b933ce7bbe4425b85e985ed68266f9 [2024-11-09 16:07:03,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 16:07:03,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 16:07:03,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 16:07:03,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 16:07:03,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 16:07:03,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6443671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03, skipping insertion in model container [2024-11-09 16:07:03,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 16:07:03,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:07:03,892 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 16:07:03,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:07:03,940 INFO L204 MainTranslator]: Completed translation [2024-11-09 16:07:03,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03 WrapperNode [2024-11-09 16:07:03,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 16:07:03,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 16:07:03,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 16:07:03,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 16:07:03,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,976 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-11-09 16:07:03,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 16:07:03,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 16:07:03,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 16:07:03,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 16:07:03,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:03,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:04,008 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2024-11-09 16:07:04,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:04,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:04,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:04,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:04,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:04,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:04,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 16:07:04,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 16:07:04,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 16:07:04,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 16:07:04,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (1/1) ... [2024-11-09 16:07:04,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:04,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:04,072 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) [2024-11-09 16:07:04,076 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 [2024-11-09 16:07:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 16:07:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2024-11-09 16:07:04,128 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2024-11-09 16:07:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 16:07:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 16:07:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 16:07:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 16:07:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 16:07:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 16:07:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 16:07:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 16:07:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 16:07:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 16:07:04,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 16:07:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-09 16:07:04,132 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-09 16:07:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2024-11-09 16:07:04,132 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2024-11-09 16:07:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 16:07:04,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 16:07:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 16:07:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 16:07:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 16:07:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 16:07:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 16:07:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-09 16:07:04,133 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-09 16:07:04,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 16:07:04,257 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 16:07:04,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 16:07:04,524 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-09 16:07:04,524 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 16:07:04,579 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 16:07:04,579 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 16:07:04,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:07:04 BoogieIcfgContainer [2024-11-09 16:07:04,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 16:07:04,587 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 16:07:04,587 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 16:07:04,593 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 16:07:04,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:07:04,594 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 04:07:03" (1/3) ... [2024-11-09 16:07:04,595 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52027e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:07:04, skipping insertion in model container [2024-11-09 16:07:04,595 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:07:04,595 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:07:03" (2/3) ... [2024-11-09 16:07:04,596 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52027e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:07:04, skipping insertion in model container [2024-11-09 16:07:04,596 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:07:04,597 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:07:04" (3/3) ... [2024-11-09 16:07:04,598 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2024-11-09 16:07:04,687 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 16:07:04,687 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 16:07:04,687 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 16:07:04,687 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 16:07:04,688 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 16:07:04,688 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 16:07:04,688 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 16:07:04,688 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 16:07:04,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 16:07:04,717 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:04,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:04,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:04,724 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:04,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 16:07:04,724 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 16:07:04,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 16:07:04,731 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-09 16:07:04,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:04,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:04,733 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:04,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 16:07:04,741 INFO L745 eck$LassoCheckResult]: Stem: 44#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 34#L109-2true [2024-11-09 16:07:04,742 INFO L747 eck$LassoCheckResult]: Loop: 34#L109-2true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L114-2true assume !(main_~b~0#1 < 6); 5#L114-3true main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 34#L109-2true [2024-11-09 16:07:04,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-11-09 16:07:04,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459498488] [2024-11-09 16:07:04,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:04,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:04,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:04,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:04,939 INFO L85 PathProgramCache]: Analyzing trace with hash 71729, now seen corresponding path program 1 times [2024-11-09 16:07:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:04,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163440466] [2024-11-09 16:07:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:04,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:07:05,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:05,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163440466] [2024-11-09 16:07:05,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163440466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:07:05,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:07:05,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 16:07:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772695205] [2024-11-09 16:07:05,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:07:05,014 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:05,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:07:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:07:05,053 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:07:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:05,097 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-11-09 16:07:05,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2024-11-09 16:07:05,105 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2024-11-09 16:07:05,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 46 transitions. [2024-11-09 16:07:05,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-09 16:07:05,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-09 16:07:05,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2024-11-09 16:07:05,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:05,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-09 16:07:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2024-11-09 16:07:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-09 16:07:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 16:07:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-09 16:07:05,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-09 16:07:05,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:07:05,156 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-09 16:07:05,157 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 16:07:05,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2024-11-09 16:07:05,158 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-09 16:07:05,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:05,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:05,159 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:05,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:05,159 INFO L745 eck$LassoCheckResult]: Stem: 138#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 109#L109-2 [2024-11-09 16:07:05,159 INFO L747 eck$LassoCheckResult]: Loop: 109#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 118#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 119#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 135#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 134#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 124#L81-1 assume true; 121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 123#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 136#L114-2 assume !(main_~b~0#1 < 6); 108#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 109#L109-2 [2024-11-09 16:07:05,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:05,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2024-11-09 16:07:05,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:05,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075141983] [2024-11-09 16:07:05,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:05,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:05,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:05,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1371427203, now seen corresponding path program 1 times [2024-11-09 16:07:05,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:05,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078469769] [2024-11-09 16:07:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:05,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:07:05,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:05,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078469769] [2024-11-09 16:07:05,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078469769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:07:05,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:07:05,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 16:07:05,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692799352] [2024-11-09 16:07:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:07:05,619 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 16:07:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 16:07:05,620 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 16:07:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:05,857 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-11-09 16:07:05,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2024-11-09 16:07:05,859 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-09 16:07:05,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2024-11-09 16:07:05,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 16:07:05,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 16:07:05,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2024-11-09 16:07:05,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:05,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-11-09 16:07:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2024-11-09 16:07:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-09 16:07:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 16:07:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-09 16:07:05,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-09 16:07:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 16:07:05,870 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-09 16:07:05,870 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 16:07:05,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2024-11-09 16:07:05,871 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-09 16:07:05,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:05,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:05,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:05,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:05,872 INFO L745 eck$LassoCheckResult]: Stem: 232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 205#L109-2 [2024-11-09 16:07:05,872 INFO L747 eck$LassoCheckResult]: Loop: 205#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 212#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 213#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 227#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 202#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 203#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 220#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 223#L61-1 assume true; 224#func_to_recursive_line_26_to_27_0EXIT >#115#return; 225#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 215#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 227#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 222#L81-1 assume true; 214#func_to_recursive_line_25_to_26_0EXIT >#117#return; 216#L81-1 assume true; 233#func_to_recursive_line_25_to_26_0EXIT >#123#return; 229#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 230#L114-2 assume !(main_~b~0#1 < 6); 204#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 205#L109-2 [2024-11-09 16:07:05,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2024-11-09 16:07:05,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:05,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428100976] [2024-11-09 16:07:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:05,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:05,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:05,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash 182328154, now seen corresponding path program 1 times [2024-11-09 16:07:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:05,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341924464] [2024-11-09 16:07:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 16:07:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 16:07:06,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:06,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341924464] [2024-11-09 16:07:06,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341924464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:07:06,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:07:06,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 16:07:06,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827289567] [2024-11-09 16:07:06,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:07:06,260 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:06,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 16:07:06,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 16:07:06,261 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 16:07:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:06,538 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-11-09 16:07:06,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2024-11-09 16:07:06,539 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-09 16:07:06,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 53 transitions. [2024-11-09 16:07:06,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 16:07:06,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 16:07:06,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-09 16:07:06,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:06,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-09 16:07:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-09 16:07:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-09 16:07:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 16:07:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-09 16:07:06,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 16:07:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 16:07:06,553 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-09 16:07:06,554 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 16:07:06,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-11-09 16:07:06,555 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-09 16:07:06,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:06,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:06,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:06,557 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:06,557 INFO L745 eck$LassoCheckResult]: Stem: 348#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 320#L109-2 [2024-11-09 16:07:06,558 INFO L747 eck$LassoCheckResult]: Loop: 320#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 327#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 328#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 344#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 342#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 317#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 335#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 314#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 332#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 333#L41-1 assume true; 334#func_to_recursive_line_27_to_28_0EXIT >#125#return; 341#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 316#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 335#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 338#L61-1 assume true; 339#func_to_recursive_line_26_to_27_0EXIT >#127#return; 340#L61-1 assume true; 349#func_to_recursive_line_26_to_27_0EXIT >#115#return; 343#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 330#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 344#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 342#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 337#L81-1 assume true; 329#func_to_recursive_line_25_to_26_0EXIT >#117#return; 331#L81-1 assume true; 350#func_to_recursive_line_25_to_26_0EXIT >#123#return; 345#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 346#L114-2 assume !(main_~b~0#1 < 6); 319#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 320#L109-2 [2024-11-09 16:07:06,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2024-11-09 16:07:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:06,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644789639] [2024-11-09 16:07:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:06,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:06,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:06,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:06,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2098832724, now seen corresponding path program 1 times [2024-11-09 16:07:06,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:06,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137124300] [2024-11-09 16:07:06,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:06,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 16:07:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 16:07:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 16:07:07,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:07,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137124300] [2024-11-09 16:07:07,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137124300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:07:07,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:07:07,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 16:07:07,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525548783] [2024-11-09 16:07:07,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:07:07,057 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:07,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 16:07:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 16:07:07,058 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 16:07:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:07,247 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-09 16:07:07,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-11-09 16:07:07,248 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-09 16:07:07,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-11-09 16:07:07,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 16:07:07,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 16:07:07,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-11-09 16:07:07,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:07,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-09 16:07:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-11-09 16:07:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-09 16:07:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-09 16:07:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-09 16:07:07,265 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-09 16:07:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 16:07:07,268 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-09 16:07:07,268 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 16:07:07,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-11-09 16:07:07,269 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-09 16:07:07,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:07,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:07,270 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:07,270 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:07,270 INFO L745 eck$LassoCheckResult]: Stem: 497#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 476#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 468#L109-2 [2024-11-09 16:07:07,271 INFO L747 eck$LassoCheckResult]: Loop: 468#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 474#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 475#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 492#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 490#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 465#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 483#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 463#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 473#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 480#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 470#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 469#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 472#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 484#L25-1 assume true; 496#func_to_recursive_line_28_to_28_0EXIT >#119#return; 461#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 462#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 473#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 480#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 481#L41-1 assume true; 482#func_to_recursive_line_27_to_28_0EXIT >#121#return; 489#L41-1 assume true; 498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 493#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 464#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 483#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 486#L61-1 assume true; 487#func_to_recursive_line_26_to_27_0EXIT >#127#return; 488#L61-1 assume true; 499#func_to_recursive_line_26_to_27_0EXIT >#115#return; 491#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 478#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 492#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 490#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 485#L81-1 assume true; 477#func_to_recursive_line_25_to_26_0EXIT >#117#return; 479#L81-1 assume true; 500#func_to_recursive_line_25_to_26_0EXIT >#123#return; 494#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 495#L114-2 assume !(main_~b~0#1 < 6); 467#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 468#L109-2 [2024-11-09 16:07:07,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2024-11-09 16:07:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:07,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174910955] [2024-11-09 16:07:07,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:07,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:07,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:07,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:07,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash 500602406, now seen corresponding path program 1 times [2024-11-09 16:07:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529868685] [2024-11-09 16:07:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 16:07:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 16:07:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 16:07:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 16:07:07,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:07,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529868685] [2024-11-09 16:07:07,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529868685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:07:07,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:07:07,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 16:07:07,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225641633] [2024-11-09 16:07:07,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:07:07,838 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:07,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 16:07:07,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 16:07:07,839 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 16:07:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:08,012 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-09 16:07:08,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-11-09 16:07:08,013 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-09 16:07:08,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-11-09 16:07:08,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 16:07:08,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 16:07:08,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-11-09 16:07:08,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:08,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-09 16:07:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-11-09 16:07:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 16:07:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-09 16:07:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-09 16:07:08,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-09 16:07:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 16:07:08,021 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-09 16:07:08,021 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 16:07:08,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2024-11-09 16:07:08,023 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-11-09 16:07:08,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:08,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:08,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:08,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:08,027 INFO L745 eck$LassoCheckResult]: Stem: 691#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 668#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 660#L109-2 [2024-11-09 16:07:08,027 INFO L747 eck$LassoCheckResult]: Loop: 660#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 666#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 667#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 684#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 682#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 657#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 675#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 654#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 665#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 672#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 662#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 661#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 664#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 663#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 661#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 664#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 676#L25-1 assume true; 690#func_to_recursive_line_28_to_28_0EXIT >#113#return; 688#L25-1 assume true; 689#func_to_recursive_line_28_to_28_0EXIT >#119#return; 653#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 655#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 665#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 672#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 673#L41-1 assume true; 674#func_to_recursive_line_27_to_28_0EXIT >#121#return; 681#L41-1 assume true; 692#func_to_recursive_line_27_to_28_0EXIT >#125#return; 685#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 656#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 675#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 678#L61-1 assume true; 679#func_to_recursive_line_26_to_27_0EXIT >#127#return; 680#L61-1 assume true; 693#func_to_recursive_line_26_to_27_0EXIT >#115#return; 683#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 670#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 684#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 682#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 677#L81-1 assume true; 669#func_to_recursive_line_25_to_26_0EXIT >#117#return; 671#L81-1 assume true; 694#func_to_recursive_line_25_to_26_0EXIT >#123#return; 686#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 687#L114-2 assume !(main_~b~0#1 < 6); 659#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 660#L109-2 [2024-11-09 16:07:08,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2024-11-09 16:07:08,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:08,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997623311] [2024-11-09 16:07:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:08,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:08,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:08,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:08,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1994055486, now seen corresponding path program 1 times [2024-11-09 16:07:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:08,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248481812] [2024-11-09 16:07:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 16:07:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 16:07:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 16:07:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 16:07:08,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:08,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248481812] [2024-11-09 16:07:08,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248481812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:08,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872977052] [2024-11-09 16:07:08,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:08,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:08,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:08,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:08,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 16:07:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:08,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 16:07:08,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 16:07:08,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 16:07:08,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872977052] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:08,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2024-11-09 16:07:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412279500] [2024-11-09 16:07:08,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:08,531 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:08,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 16:07:08,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 16:07:08,532 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. cyclomatic complexity: 14 Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 16:07:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:08,699 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2024-11-09 16:07:08,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2024-11-09 16:07:08,702 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-11-09 16:07:08,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 63 transitions. [2024-11-09 16:07:08,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-09 16:07:08,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-09 16:07:08,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2024-11-09 16:07:08,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:08,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-11-09 16:07:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2024-11-09 16:07:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 16:07:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-09 16:07:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2024-11-09 16:07:08,714 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-11-09 16:07:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 16:07:08,715 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-11-09 16:07:08,715 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 16:07:08,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 63 transitions. [2024-11-09 16:07:08,716 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-11-09 16:07:08,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:08,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:08,722 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:08,722 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2024-11-09 16:07:08,722 INFO L745 eck$LassoCheckResult]: Stem: 1200#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 1163#L109-2 [2024-11-09 16:07:08,722 INFO L747 eck$LassoCheckResult]: Loop: 1163#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1172#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1173#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1195#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1196#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1179#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1205#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1207#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1177#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1204#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1206#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1178#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1202#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1201#L114-2 assume !(main_~b~0#1 < 6); 1162#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 1163#L109-2 [2024-11-09 16:07:08,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:08,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2024-11-09 16:07:08,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:08,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45359262] [2024-11-09 16:07:08,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:08,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:08,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:08,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:08,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2143273103, now seen corresponding path program 2 times [2024-11-09 16:07:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:08,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016696743] [2024-11-09 16:07:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 16:07:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 16:07:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 16:07:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 16:07:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 16:07:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 16:07:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 16:07:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 16:07:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 16:07:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 16:07:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 16:07:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 16:07:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 16:07:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 16:07:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 16:07:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 51 proven. 67 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2024-11-09 16:07:10,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:10,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016696743] [2024-11-09 16:07:10,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016696743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288184651] [2024-11-09 16:07:10,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 16:07:10,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:10,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:10,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:10,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 16:07:10,747 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 16:07:10,748 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:10,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 16:07:10,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-11-09 16:07:10,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-11-09 16:07:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288184651] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:11,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:11,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-11-09 16:07:11,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008983342] [2024-11-09 16:07:11,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:11,258 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:11,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:11,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 16:07:11,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-09 16:07:11,259 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. cyclomatic complexity: 17 Second operand has 18 states, 16 states have (on average 3.5625) internal successors, (57), 14 states have internal predecessors, (57), 9 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-09 16:07:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:11,608 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-11-09 16:07:11,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 73 transitions. [2024-11-09 16:07:11,610 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-09 16:07:11,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 73 transitions. [2024-11-09 16:07:11,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-09 16:07:11,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-09 16:07:11,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 73 transitions. [2024-11-09 16:07:11,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:11,612 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-11-09 16:07:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 73 transitions. [2024-11-09 16:07:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 16:07:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 13 states have call successors, (13), 4 states have call predecessors, (13), 9 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-09 16:07:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2024-11-09 16:07:11,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-11-09 16:07:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 16:07:11,617 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-11-09 16:07:11,617 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 16:07:11,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 73 transitions. [2024-11-09 16:07:11,618 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-09 16:07:11,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:11,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:11,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:11,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-09 16:07:11,622 INFO L745 eck$LassoCheckResult]: Stem: 2902#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2875#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 2867#L109-2 [2024-11-09 16:07:11,622 INFO L747 eck$LassoCheckResult]: Loop: 2867#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2873#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2874#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2898#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2899#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2881#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2913#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2918#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2882#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2914#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2917#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2877#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2911#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2916#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2878#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2912#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2915#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2880#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 2864#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 2861#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 2870#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2869#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2868#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 2871#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2887#L25-1 assume true; 2900#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2901#L25-1 assume true; 2909#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2904#L25-1 assume true; 2903#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2860#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2862#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2872#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 2884#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2885#L41-1 assume true; 2886#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2893#L41-1 assume true; 2905#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2897#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2863#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2865#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 2888#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2890#L61-1 assume true; 2891#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2892#L61-1 assume true; 2906#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2895#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2879#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2896#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 2894#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2889#L81-1 assume true; 2876#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2883#L81-1 assume true; 2910#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2908#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2907#L114-2 assume !(main_~b~0#1 < 6); 2866#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 2867#L109-2 [2024-11-09 16:07:11,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2024-11-09 16:07:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:11,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212073724] [2024-11-09 16:07:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:11,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:11,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:11,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:11,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:11,638 INFO L85 PathProgramCache]: Analyzing trace with hash -889787645, now seen corresponding path program 3 times [2024-11-09 16:07:11,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:11,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321265365] [2024-11-09 16:07:11,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:11,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:12,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:12,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:12,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:12,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 16:07:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:12,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 16:07:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 16:07:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 16:07:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 16:07:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 16:07:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 16:07:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 16:07:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 16:07:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 16:07:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 16:07:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 16:07:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 16:07:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 16:07:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 16:07:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-09 16:07:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 16:07:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 16:07:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 16:07:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-09 16:07:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 16:07:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 16:07:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 16:07:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 81 proven. 208 refuted. 0 times theorem prover too weak. 1367 trivial. 0 not checked. [2024-11-09 16:07:14,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:14,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321265365] [2024-11-09 16:07:14,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321265365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:14,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358721475] [2024-11-09 16:07:14,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 16:07:14,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:14,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:14,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:14,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 16:07:14,287 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 16:07:14,287 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:14,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 16:07:14,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:14,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 16:07:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 1542 trivial. 0 not checked. [2024-11-09 16:07:14,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 1541 trivial. 0 not checked. [2024-11-09 16:07:15,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358721475] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:15,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:15,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 30 [2024-11-09 16:07:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86313316] [2024-11-09 16:07:15,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:15,432 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:15,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:15,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 16:07:15,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2024-11-09 16:07:15,433 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. cyclomatic complexity: 19 Second operand has 30 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 11 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (24), 8 states have call predecessors, (24), 11 states have call successors, (24) [2024-11-09 16:07:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:16,106 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-09 16:07:16,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2024-11-09 16:07:16,107 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-09 16:07:16,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 77 transitions. [2024-11-09 16:07:16,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-11-09 16:07:16,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2024-11-09 16:07:16,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 77 transitions. [2024-11-09 16:07:16,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:16,114 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-09 16:07:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 77 transitions. [2024-11-09 16:07:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-09 16:07:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 13 states have call successors, (13), 4 states have call predecessors, (13), 11 states have return successors, (20), 16 states have call predecessors, (20), 13 states have call successors, (20) [2024-11-09 16:07:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2024-11-09 16:07:16,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-09 16:07:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 16:07:16,125 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-09 16:07:16,125 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 16:07:16,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 77 transitions. [2024-11-09 16:07:16,126 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-09 16:07:16,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:16,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:16,136 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:16,136 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 36, 36, 36, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-09 16:07:16,137 INFO L745 eck$LassoCheckResult]: Stem: 5773#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 5744#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 5738#L109-2 [2024-11-09 16:07:16,137 INFO L747 eck$LassoCheckResult]: Loop: 5738#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 5745#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5746#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5769#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5770#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5748#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5784#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5793#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5749#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5785#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5792#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5750#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5786#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5791#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5752#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5788#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5789#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5753#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 5735#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 5732#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 5741#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5740#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5739#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 5742#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5759#L25-1 assume true; 5771#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5772#L25-1 assume true; 5779#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5778#L25-1 assume true; 5777#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5776#L25-1 assume true; 5775#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5731#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5733#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5743#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 5755#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5756#L41-1 assume true; 5757#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5764#L41-1 assume true; 5780#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5768#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5734#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5736#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 5758#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5761#L61-1 assume true; 5762#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5763#L61-1 assume true; 5774#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5766#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5751#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5767#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 5765#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5760#L81-1 assume true; 5747#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5754#L81-1 assume true; 5790#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5787#L81-1 assume true; 5783#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5782#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 5781#L114-2 assume !(main_~b~0#1 < 6); 5737#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 5738#L109-2 [2024-11-09 16:07:16,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2024-11-09 16:07:16,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:16,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894390617] [2024-11-09 16:07:16,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:16,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:16,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:16,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:16,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2093812593, now seen corresponding path program 4 times [2024-11-09 16:07:16,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:16,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952730789] [2024-11-09 16:07:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:16,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 16:07:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:18,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-09 16:07:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-11-09 16:07:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2024-11-09 16:07:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 517 [2024-11-09 16:07:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 16:07:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 16:07:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8607 backedges. 17 proven. 297 refuted. 0 times theorem prover too weak. 8293 trivial. 0 not checked. [2024-11-09 16:07:19,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:19,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952730789] [2024-11-09 16:07:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952730789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:19,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131881865] [2024-11-09 16:07:19,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 16:07:19,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:19,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:19,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:19,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 16:07:20,610 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 16:07:20,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:20,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 4364 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 16:07:20,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:20,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 16:07:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8607 backedges. 1637 proven. 3 refuted. 0 times theorem prover too weak. 6967 trivial. 0 not checked. [2024-11-09 16:07:20,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8607 backedges. 265 proven. 26 refuted. 0 times theorem prover too weak. 8316 trivial. 0 not checked. [2024-11-09 16:07:22,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131881865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:22,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:22,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2024-11-09 16:07:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337244811] [2024-11-09 16:07:22,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:22,394 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:22,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 16:07:22,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2024-11-09 16:07:22,396 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. cyclomatic complexity: 19 Second operand has 27 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 11 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (29), 8 states have call predecessors, (29), 11 states have call successors, (29) [2024-11-09 16:07:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:22,957 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2024-11-09 16:07:22,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 81 transitions. [2024-11-09 16:07:22,959 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-09 16:07:22,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 81 transitions. [2024-11-09 16:07:22,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-11-09 16:07:22,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-11-09 16:07:22,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 81 transitions. [2024-11-09 16:07:22,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:22,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-09 16:07:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 81 transitions. [2024-11-09 16:07:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-09 16:07:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 13 states have return successors, (22), 18 states have call predecessors, (22), 13 states have call successors, (22) [2024-11-09 16:07:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-11-09 16:07:22,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-09 16:07:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 16:07:22,969 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-09 16:07:22,969 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 16:07:22,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 81 transitions. [2024-11-09 16:07:22,970 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-09 16:07:22,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:22,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:22,985 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:22,985 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [192, 192, 144, 144, 144, 72, 72, 48, 48, 48, 48, 48, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-09 16:07:22,985 INFO L745 eck$LassoCheckResult]: Stem: 12109#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 12082#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 12074#L109-2 [2024-11-09 16:07:22,988 INFO L747 eck$LassoCheckResult]: Loop: 12074#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 12080#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12081#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12096#L81-1 assume true; 12083#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12090#L81-1 assume true; 12128#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12125#L81-1 assume true; 12121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12105#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12106#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12084#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12096#L81-1 assume true; 12083#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12090#L81-1 assume true; 12128#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12125#L81-1 assume true; 12121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12122#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12133#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12085#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12096#L81-1 assume true; 12083#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12090#L81-1 assume true; 12128#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12125#L81-1 assume true; 12121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12123#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12132#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12086#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12096#L81-1 assume true; 12083#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12090#L81-1 assume true; 12128#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12125#L81-1 assume true; 12121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12124#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12129#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12088#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12096#L81-1 assume true; 12083#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12090#L81-1 assume true; 12128#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12125#L81-1 assume true; 12121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12126#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12127#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 12089#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 12071#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 12069#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 12077#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 12076#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 12075#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 12078#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12095#L25-1 assume true; 12107#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12108#L25-1 assume true; 12131#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12130#L25-1 assume true; 12120#func_to_recursive_line_28_to_28_0EXIT >#113#return; 12111#L25-1 assume true; 12110#func_to_recursive_line_28_to_28_0EXIT >#119#return; 12067#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 12068#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 12079#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 12091#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12092#L41-1 assume true; 12093#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12100#L41-1 assume true; 12116#func_to_recursive_line_27_to_28_0EXIT >#121#return; 12113#L41-1 assume true; 12112#func_to_recursive_line_27_to_28_0EXIT >#125#return; 12104#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 12070#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12072#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 12094#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12097#L61-1 assume true; 12098#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12099#L61-1 assume true; 12117#func_to_recursive_line_26_to_27_0EXIT >#127#return; 12115#L61-1 assume true; 12114#func_to_recursive_line_26_to_27_0EXIT >#115#return; 12102#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 12087#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 12103#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 12101#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 12096#L81-1 assume true; 12083#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12090#L81-1 assume true; 12128#func_to_recursive_line_25_to_26_0EXIT >#117#return; 12125#L81-1 assume true; 12121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 12119#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 12118#L114-2 assume !(main_~b~0#1 < 6); 12073#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 12074#L109-2 [2024-11-09 16:07:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times [2024-11-09 16:07:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188183509] [2024-11-09 16:07:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:23,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:23,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:23,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1891899185, now seen corresponding path program 5 times [2024-11-09 16:07:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090824610] [2024-11-09 16:07:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:23,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:29,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-11-09 16:07:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:32,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-09 16:07:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 845 [2024-11-09 16:07:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1126 [2024-11-09 16:07:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1407 [2024-11-09 16:07:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:34,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 16:07:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 16:07:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 16:07:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 101457 backedges. 696 proven. 2852 refuted. 0 times theorem prover too weak. 97909 trivial. 0 not checked. [2024-11-09 16:07:35,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:35,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090824610] [2024-11-09 16:07:35,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090824610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:35,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165468382] [2024-11-09 16:07:35,355 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 16:07:35,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:35,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:35,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:35,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 16:07:36,187 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-09 16:07:36,187 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:36,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 16:07:36,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:36,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 16:07:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 101457 backedges. 11562 proven. 15 refuted. 0 times theorem prover too weak. 89880 trivial. 0 not checked. [2024-11-09 16:07:36,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 101457 backedges. 183 proven. 3807 refuted. 0 times theorem prover too weak. 97467 trivial. 0 not checked. [2024-11-09 16:07:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165468382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:42,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 18] total 41 [2024-11-09 16:07:42,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128051439] [2024-11-09 16:07:42,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:42,332 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:42,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:42,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 16:07:42,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 16:07:42,337 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. cyclomatic complexity: 19 Second operand has 41 states, 30 states have (on average 2.8) internal successors, (84), 33 states have internal predecessors, (84), 14 states have call successors, (44), 10 states have call predecessors, (44), 12 states have return successors, (39), 11 states have call predecessors, (39), 14 states have call successors, (39) [2024-11-09 16:07:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:42,858 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-11-09 16:07:42,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 85 transitions. [2024-11-09 16:07:42,860 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-09 16:07:42,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 85 transitions. [2024-11-09 16:07:42,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2024-11-09 16:07:42,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2024-11-09 16:07:42,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2024-11-09 16:07:42,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:42,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-09 16:07:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2024-11-09 16:07:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-09 16:07:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 15 states have return successors, (24), 20 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-09 16:07:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-11-09 16:07:42,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-09 16:07:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 16:07:42,873 INFO L425 stractBuchiCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-09 16:07:42,873 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 16:07:42,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 85 transitions. [2024-11-09 16:07:42,874 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-09 16:07:42,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:42,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:42,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:07:42,883 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [288, 288, 240, 240, 240, 72, 72, 48, 48, 48, 48, 48, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-09 16:07:42,884 INFO L745 eck$LassoCheckResult]: Stem: 31755#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 31726#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 31720#L109-2 [2024-11-09 16:07:42,885 INFO L747 eck$LassoCheckResult]: Loop: 31720#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 31727#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 31728#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 31742#L81-1 assume true; 31729#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31736#L81-1 assume true; 31779#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31777#L81-1 assume true; 31773#func_to_recursive_line_25_to_26_0EXIT >#123#return; 31751#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 31752#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 31730#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 31742#L81-1 assume true; 31729#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31736#L81-1 assume true; 31779#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31777#L81-1 assume true; 31773#func_to_recursive_line_25_to_26_0EXIT >#123#return; 31774#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 31783#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 31731#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 31742#L81-1 assume true; 31729#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31736#L81-1 assume true; 31779#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31777#L81-1 assume true; 31773#func_to_recursive_line_25_to_26_0EXIT >#123#return; 31775#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 31782#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 31732#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 31742#L81-1 assume true; 31729#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31736#L81-1 assume true; 31779#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31777#L81-1 assume true; 31773#func_to_recursive_line_25_to_26_0EXIT >#123#return; 31776#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 31781#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 31734#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 31742#L81-1 assume true; 31729#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31736#L81-1 assume true; 31779#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31777#L81-1 assume true; 31773#func_to_recursive_line_25_to_26_0EXIT >#123#return; 31778#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 31780#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 31735#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 31717#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 31714#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 31723#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 31722#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 31721#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 31724#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 31741#L25-1 assume true; 31753#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31754#L25-1 assume true; 31767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31764#L25-1 assume true; 31763#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31762#L25-1 assume true; 31761#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31760#L25-1 assume true; 31759#func_to_recursive_line_28_to_28_0EXIT >#113#return; 31758#L25-1 assume true; 31757#func_to_recursive_line_28_to_28_0EXIT >#119#return; 31713#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 31715#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 31725#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 31737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 31738#L41-1 assume true; 31739#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31746#L41-1 assume true; 31768#func_to_recursive_line_27_to_28_0EXIT >#121#return; 31766#L41-1 assume true; 31765#func_to_recursive_line_27_to_28_0EXIT >#125#return; 31750#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 31716#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 31740#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 31743#L61-1 assume true; 31744#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31745#L61-1 assume true; 31756#func_to_recursive_line_26_to_27_0EXIT >#127#return; 31770#L61-1 assume true; 31769#func_to_recursive_line_26_to_27_0EXIT >#115#return; 31748#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 31733#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 31749#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 31747#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 31742#L81-1 assume true; 31729#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31736#L81-1 assume true; 31779#func_to_recursive_line_25_to_26_0EXIT >#117#return; 31777#L81-1 assume true; 31773#func_to_recursive_line_25_to_26_0EXIT >#123#return; 31772#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 31771#L114-2 assume !(main_~b~0#1 < 6); 31719#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 31720#L109-2 [2024-11-09 16:07:42,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:42,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 11 times [2024-11-09 16:07:42,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:42,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691593475] [2024-11-09 16:07:42,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:42,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:42,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:42,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:42,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1857853647, now seen corresponding path program 6 times [2024-11-09 16:07:42,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:42,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853341567] [2024-11-09 16:07:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:42,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:50,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:51,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:52,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2024-11-09 16:07:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 724 [2024-11-09 16:07:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1085 [2024-11-09 16:07:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:54,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1446 [2024-11-09 16:07:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1807 [2024-11-09 16:07:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 16:07:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 16:07:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 211809 backedges. 303 proven. 6515 refuted. 0 times theorem prover too weak. 204991 trivial. 0 not checked. [2024-11-09 16:07:57,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:57,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853341567] [2024-11-09 16:07:57,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853341567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:57,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125094595] [2024-11-09 16:07:57,086 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 16:07:57,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:57,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:57,089 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:57,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 16:07:58,223 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-09 16:07:58,223 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:58,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 16:07:58,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:58,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 16:07:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 211809 backedges. 256 proven. 8 refuted. 0 times theorem prover too weak. 211545 trivial. 0 not checked. [2024-11-09 16:07:58,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:08:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 211809 backedges. 256 proven. 15 refuted. 0 times theorem prover too weak. 211538 trivial. 0 not checked. [2024-11-09 16:08:04,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125094595] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:08:04,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:08:04,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 14] total 36 [2024-11-09 16:08:04,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827235007] [2024-11-09 16:08:04,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:08:04,347 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:08:04,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:08:04,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 16:08:04,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 16:08:04,350 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. cyclomatic complexity: 19 Second operand has 36 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 12 states have call successors, (30), 9 states have call predecessors, (30), 14 states have return successors, (31), 14 states have call predecessors, (31), 12 states have call successors, (31) [2024-11-09 16:08:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:08:04,938 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2024-11-09 16:08:04,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 89 transitions. [2024-11-09 16:08:04,942 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-09 16:08:04,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 89 transitions. [2024-11-09 16:08:04,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2024-11-09 16:08:04,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2024-11-09 16:08:04,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 89 transitions. [2024-11-09 16:08:04,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:08:04,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-11-09 16:08:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 89 transitions. [2024-11-09 16:08:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 16:08:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 48 states have internal predecessors, (50), 13 states have call successors, (13), 4 states have call predecessors, (13), 17 states have return successors, (26), 22 states have call predecessors, (26), 13 states have call successors, (26) [2024-11-09 16:08:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2024-11-09 16:08:04,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-11-09 16:08:04,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 16:08:04,957 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-11-09 16:08:04,957 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 16:08:04,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 89 transitions. [2024-11-09 16:08:04,958 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-11-09 16:08:04,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:08:04,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:08:04,966 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 16:08:04,966 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [504, 504, 432, 432, 432, 108, 108, 72, 72, 72, 72, 72, 72, 72, 54, 54, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1, 1] [2024-11-09 16:08:04,967 INFO L745 eck$LassoCheckResult]: Stem: 58998#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 58971#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 58963#L109-2 [2024-11-09 16:08:04,969 INFO L747 eck$LassoCheckResult]: Loop: 58963#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 58969#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 58970#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 58985#L81-1 assume true; 58972#func_to_recursive_line_25_to_26_0EXIT >#117#return; 58979#L81-1 assume true; 59024#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59022#L81-1 assume true; 59021#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59015#L81-1 assume true; 59014#func_to_recursive_line_25_to_26_0EXIT >#123#return; 58994#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 58995#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 58977#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 58985#L81-1 assume true; 58972#func_to_recursive_line_25_to_26_0EXIT >#117#return; 58979#L81-1 assume true; 59024#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59022#L81-1 assume true; 59021#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59015#L81-1 assume true; 59014#func_to_recursive_line_25_to_26_0EXIT >#123#return; 59018#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 59028#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 58978#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 58985#L81-1 assume true; 58972#func_to_recursive_line_25_to_26_0EXIT >#117#return; 58979#L81-1 assume true; 59024#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59022#L81-1 assume true; 59021#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59015#L81-1 assume true; 59014#func_to_recursive_line_25_to_26_0EXIT >#123#return; 59019#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 59025#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 58974#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 58985#L81-1 assume true; 58972#func_to_recursive_line_25_to_26_0EXIT >#117#return; 58979#L81-1 assume true; 59024#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59022#L81-1 assume true; 59021#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59015#L81-1 assume true; 59014#func_to_recursive_line_25_to_26_0EXIT >#123#return; 59016#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 59023#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 58975#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 58985#L81-1 assume true; 58972#func_to_recursive_line_25_to_26_0EXIT >#117#return; 58979#L81-1 assume true; 59024#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59022#L81-1 assume true; 59021#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59015#L81-1 assume true; 59014#func_to_recursive_line_25_to_26_0EXIT >#123#return; 59017#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 59020#L114-2 assume !!(main_~b~0#1 < 6);call write~int#2(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 58976#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4); 58960#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~e.base, ~e.offset, 4); 58957#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4); 58965#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 58966#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 58964#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4); 58967#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 58983#L25-1 assume true; 58996#func_to_recursive_line_28_to_28_0EXIT >#113#return; 58997#L25-1 assume true; 59030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59029#L25-1 assume true; 59027#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59026#L25-1 assume true; 59013#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59011#L25-1 assume true; 59009#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59008#L25-1 assume true; 59007#func_to_recursive_line_28_to_28_0EXIT >#113#return; 59001#L25-1 assume true; 59000#func_to_recursive_line_28_to_28_0EXIT >#119#return; 58956#L47-1 call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 58958#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 58968#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4); 58980#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 58981#L41-1 assume true; 58982#func_to_recursive_line_27_to_28_0EXIT >#121#return; 58989#L41-1 assume true; 59006#func_to_recursive_line_27_to_28_0EXIT >#121#return; 59003#L41-1 assume true; 59002#func_to_recursive_line_27_to_28_0EXIT >#125#return; 58993#L67-1 call #t~mem11 := read~int#1(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 58959#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58961#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#1(~d.base, ~d.offset, 4); 58984#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 58986#L61-1 assume true; 58987#func_to_recursive_line_26_to_27_0EXIT >#127#return; 58988#L61-1 assume true; 58999#func_to_recursive_line_26_to_27_0EXIT >#127#return; 59005#L61-1 assume true; 59004#func_to_recursive_line_26_to_27_0EXIT >#115#return; 58991#L87-1 call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 58973#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 58992#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#2(~c.base, ~c.offset, 4); 58990#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 58985#L81-1 assume true; 58972#func_to_recursive_line_25_to_26_0EXIT >#117#return; 58979#L81-1 assume true; 59024#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59022#L81-1 assume true; 59021#func_to_recursive_line_25_to_26_0EXIT >#117#return; 59015#L81-1 assume true; 59014#func_to_recursive_line_25_to_26_0EXIT >#123#return; 59012#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 59010#L114-2 assume !(main_~b~0#1 < 6); 58962#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 58963#L109-2 [2024-11-09 16:08:04,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:08:04,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 12 times [2024-11-09 16:08:04,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:08:04,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490431193] [2024-11-09 16:08:04,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:08:04,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:08:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:08:04,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:08:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:08:05,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:08:05,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:08:05,015 INFO L85 PathProgramCache]: Analyzing trace with hash 257910735, now seen corresponding path program 7 times [2024-11-09 16:08:05,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:08:05,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303799846] [2024-11-09 16:08:05,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:08:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:08:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat