./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-551b009-m [2025-01-10 07:51:08,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:51:08,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:51:08,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:51:08,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:51:08,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:51:08,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:51:08,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:51:08,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:51:08,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:51:08,668 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:51:08,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:51:08,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:51:08,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:51:08,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:51:08,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:51:08,670 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:51:08,670 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 [2025-01-10 07:51:08,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:51:08,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:51:08,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:51:08,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:51:08,944 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:51:08,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2025-01-10 07:51:10,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf1e13002/d5d7292deab34dab9c3ea856c99a966c/FLAGa3b3941ec [2025-01-10 07:51:10,538 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:51:10,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2025-01-10 07:51:10,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf1e13002/d5d7292deab34dab9c3ea856c99a966c/FLAGa3b3941ec [2025-01-10 07:51:10,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf1e13002/d5d7292deab34dab9c3ea856c99a966c [2025-01-10 07:51:10,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:51:10,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:51:10,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:51:10,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:51:10,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:51:10,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55da1e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10, skipping insertion in model container [2025-01-10 07:51:10,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:51:10,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:51:10,708 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:51:10,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:51:10,739 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:51:10,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10 WrapperNode [2025-01-10 07:51:10,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:51:10,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:51:10,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:51:10,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:51:10,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,762 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2025-01-10 07:51:10,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:51:10,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:51:10,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:51:10,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:51:10,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,786 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]. [2025-01-10 07:51:10,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:51:10,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:51:10,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:51:10,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:51:10,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (1/1) ... [2025-01-10 07:51:10,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:51:10,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:10,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:51:10,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:51:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:51:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2025-01-10 07:51:10,842 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-01-10 07:51:10,843 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-01-10 07:51:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2025-01-10 07:51:10,844 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2025-01-10 07:51:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:51:10,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:51:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 07:51:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 07:51:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 07:51:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 07:51:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 07:51:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-01-10 07:51:10,844 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-01-10 07:51:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 07:51:10,902 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:51:10,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:51:11,042 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-10 07:51:11,042 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:51:11,049 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:51:11,049 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:51:11,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:51:11 BoogieIcfgContainer [2025-01-10 07:51:11,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:51:11,050 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:51:11,050 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:51:11,054 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:51:11,054 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:51:11,055 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:51:10" (1/3) ... [2025-01-10 07:51:11,055 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@665ca5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:51:11, skipping insertion in model container [2025-01-10 07:51:11,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:51:11,055 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:51:10" (2/3) ... [2025-01-10 07:51:11,056 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@665ca5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:51:11, skipping insertion in model container [2025-01-10 07:51:11,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:51:11,056 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:51:11" (3/3) ... [2025-01-10 07:51:11,057 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2025-01-10 07:51:11,087 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:51:11,087 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:51:11,087 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:51:11,087 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:51:11,087 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:51:11,087 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:51:11,087 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:51:11,088 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:51:11,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 32 states have (on average 1.34375) internal successors, (43), 36 states have internal predecessors, (43), 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) [2025-01-10 07:51:11,102 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2025-01-10 07:51:11,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:11,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:11,106 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:11,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:51:11,106 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:51:11,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 32 states have (on average 1.34375) internal successors, (43), 36 states have internal predecessors, (43), 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) [2025-01-10 07:51:11,108 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2025-01-10 07:51:11,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:11,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:11,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:11,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-01-10 07:51:11,113 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:11,113 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2025-01-10 07:51:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:11,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461764388] [2025-01-10 07:51:11,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:11,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:11,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:11,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:11,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:11,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:11,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:11,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:11,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:11,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:11,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:11,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:11,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2153, now seen corresponding path program 1 times [2025-01-10 07:51:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:11,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052742022] [2025-01-10 07:51:11,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:11,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:11,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:11,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:11,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:51:11,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:11,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052742022] [2025-01-10 07:51:11,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052742022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:51:11,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:51:11,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 07:51:11,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676288828] [2025-01-10 07:51:11,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:51:11,284 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:11,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:11,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:51:11,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:51:11,305 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.34375) internal successors, (43), 36 states have internal predecessors, (43), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2025-01-10 07:51:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:11,334 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2025-01-10 07:51:11,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 61 transitions. [2025-01-10 07:51:11,337 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2025-01-10 07:51:11,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 45 transitions. [2025-01-10 07:51:11,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-01-10 07:51:11,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-01-10 07:51:11,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2025-01-10 07:51:11,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:11,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2025-01-10 07:51:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2025-01-10 07:51:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-01-10 07:51:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 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) [2025-01-10 07:51:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2025-01-10 07:51:11,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-01-10 07:51:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:51:11,374 INFO L432 stractBuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2025-01-10 07:51:11,374 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:51:11,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2025-01-10 07:51:11,375 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:11,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:11,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:11,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:11,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:11,377 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:11,377 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:11,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2025-01-10 07:51:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:11,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528903081] [2025-01-10 07:51:11,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:51:11,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:11,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:11,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:11,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:51:11,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:11,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:11,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:11,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:11,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:11,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:11,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:11,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1723079211, now seen corresponding path program 1 times [2025-01-10 07:51:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:11,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369146138] [2025-01-10 07:51:11,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:11,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 07:51:11,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 07:51:11,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:11,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:51:11,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:11,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369146138] [2025-01-10 07:51:11,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369146138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:51:11,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:51:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:51:11,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885676783] [2025-01-10 07:51:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:51:11,614 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:11,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:11,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:51:11,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:51:11,617 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2025-01-10 07:51:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:11,810 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2025-01-10 07:51:11,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2025-01-10 07:51:11,811 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:11,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2025-01-10 07:51:11,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-01-10 07:51:11,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-01-10 07:51:11,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2025-01-10 07:51:11,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:11,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-01-10 07:51:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2025-01-10 07:51:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-10 07:51:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 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), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-10 07:51:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-01-10 07:51:11,820 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-01-10 07:51:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:51:11,821 INFO L432 stractBuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-01-10 07:51:11,821 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:51:11,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2025-01-10 07:51:11,822 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:11,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:11,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:11,824 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:11,824 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:51:11,825 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:11,825 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:11,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2025-01-10 07:51:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318922502] [2025-01-10 07:51:11,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:51:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:11,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:11,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:11,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:51:11,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:11,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:11,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:11,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:11,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:11,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:11,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:11,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:11,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1803646538, now seen corresponding path program 1 times [2025-01-10 07:51:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101070773] [2025-01-10 07:51:11,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:11,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 07:51:11,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:51:11,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:11,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 07:51:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101070773] [2025-01-10 07:51:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101070773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:51:12,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:51:12,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:51:12,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360979661] [2025-01-10 07:51:12,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:51:12,070 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:12,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:12,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:51:12,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:51:12,071 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2025-01-10 07:51:12,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:12,174 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2025-01-10 07:51:12,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2025-01-10 07:51:12,176 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:12,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2025-01-10 07:51:12,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-01-10 07:51:12,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2025-01-10 07:51:12,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2025-01-10 07:51:12,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:12,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2025-01-10 07:51:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2025-01-10 07:51:12,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 07:51:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 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), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-10 07:51:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2025-01-10 07:51:12,181 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 46 transitions. [2025-01-10 07:51:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:51:12,187 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2025-01-10 07:51:12,187 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:51:12,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 46 transitions. [2025-01-10 07:51:12,188 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:12,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:12,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:12,188 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:12,188 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] [2025-01-10 07:51:12,188 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:12,189 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:12,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2025-01-10 07:51:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:12,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871014783] [2025-01-10 07:51:12,189 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:51:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:12,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-01-10 07:51:12,208 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:12,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:51:12,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:12,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:12,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:12,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:12,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:12,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:12,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:12,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash -951309558, now seen corresponding path program 1 times [2025-01-10 07:51:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:12,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470959160] [2025-01-10 07:51:12,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:12,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 07:51:12,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 07:51:12,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:12,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 07:51:12,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:12,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470959160] [2025-01-10 07:51:12,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470959160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:51:12,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:51:12,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:51:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712720337] [2025-01-10 07:51:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:51:12,491 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:12,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:51:12,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:51:12,491 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 07:51:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:12,587 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-01-10 07:51:12,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2025-01-10 07:51:12,588 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:12,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2025-01-10 07:51:12,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-01-10 07:51:12,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-01-10 07:51:12,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2025-01-10 07:51:12,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:12,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-01-10 07:51:12,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2025-01-10 07:51:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-10 07:51:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 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), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-01-10 07:51:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-01-10 07:51:12,595 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-01-10 07:51:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:51:12,596 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-01-10 07:51:12,600 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:51:12,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2025-01-10 07:51:12,601 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:12,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:12,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:12,602 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:12,602 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] [2025-01-10 07:51:12,602 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:12,602 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:12,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2025-01-10 07:51:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:12,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106650258] [2025-01-10 07:51:12,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:51:12,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:12,612 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:12,620 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:12,620 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:51:12,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:12,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:12,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:12,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:12,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:12,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:12,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:12,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:12,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1331471986, now seen corresponding path program 1 times [2025-01-10 07:51:12,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:12,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6835031] [2025-01-10 07:51:12,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:12,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:12,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 07:51:12,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 07:51:12,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:12,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 07:51:12,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:12,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6835031] [2025-01-10 07:51:12,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6835031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:51:12,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:51:12,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 07:51:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505723013] [2025-01-10 07:51:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:51:12,888 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:12,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:51:12,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:51:12,889 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-10 07:51:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:12,951 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-01-10 07:51:12,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. [2025-01-10 07:51:12,952 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:12,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 50 transitions. [2025-01-10 07:51:12,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-01-10 07:51:12,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-01-10 07:51:12,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2025-01-10 07:51:12,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:12,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-01-10 07:51:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2025-01-10 07:51:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-10 07:51:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 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), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-10 07:51:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-01-10 07:51:12,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-01-10 07:51:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:51:12,960 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-01-10 07:51:12,960 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:51:12,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 50 transitions. [2025-01-10 07:51:12,961 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-01-10 07:51:12,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:12,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:12,962 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:12,962 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] [2025-01-10 07:51:12,962 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:12,962 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:12,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2025-01-10 07:51:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336931787] [2025-01-10 07:51:12,963 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:51:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:12,968 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:12,971 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:12,971 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:51:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:12,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:12,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:12,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:12,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:12,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:12,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:12,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1302113820, now seen corresponding path program 1 times [2025-01-10 07:51:12,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:12,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057995776] [2025-01-10 07:51:12,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:12,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:12,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 07:51:12,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 07:51:12,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:12,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 07:51:13,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:13,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057995776] [2025-01-10 07:51:13,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057995776] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:13,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512132263] [2025-01-10 07:51:13,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:51:13,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:13,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:13,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:13,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 07:51:13,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 07:51:13,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 07:51:13,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:13,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:13,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 07:51:13,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 07:51:13,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 07:51:13,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512132263] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:13,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 07:51:13,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573219086] [2025-01-10 07:51:13,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:13,244 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:13,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:51:13,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:51:13,244 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 07:51:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:13,303 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2025-01-10 07:51:13,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2025-01-10 07:51:13,304 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2025-01-10 07:51:13,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 62 transitions. [2025-01-10 07:51:13,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-01-10 07:51:13,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-01-10 07:51:13,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2025-01-10 07:51:13,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:13,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-01-10 07:51:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2025-01-10 07:51:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 07:51:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 34 states have internal predecessors, (36), 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) [2025-01-10 07:51:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2025-01-10 07:51:13,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-01-10 07:51:13,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:51:13,317 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-01-10 07:51:13,317 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-01-10 07:51:13,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2025-01-10 07:51:13,318 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2025-01-10 07:51:13,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:13,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:13,324 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:13,324 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] [2025-01-10 07:51:13,324 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:13,324 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:13,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:13,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2025-01-10 07:51:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:13,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983540614] [2025-01-10 07:51:13,326 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:51:13,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:13,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:13,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:13,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:13,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:13,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:13,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:13,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:13,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:13,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:13,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:13,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:13,353 INFO L85 PathProgramCache]: Analyzing trace with hash -566802391, now seen corresponding path program 2 times [2025-01-10 07:51:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:13,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228186150] [2025-01-10 07:51:13,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:51:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:13,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-01-10 07:51:13,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-01-10 07:51:13,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:51:13,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 49 proven. 67 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2025-01-10 07:51:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228186150] [2025-01-10 07:51:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228186150] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210126869] [2025-01-10 07:51:15,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:51:15,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:15,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:15,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:15,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 07:51:15,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-01-10 07:51:15,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-01-10 07:51:15,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:51:15,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:15,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 07:51:15,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-01-10 07:51:15,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-01-10 07:51:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210126869] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:15,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2025-01-10 07:51:15,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490379652] [2025-01-10 07:51:15,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:15,895 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:15,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 07:51:15,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-10 07:51:15,896 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. cyclomatic complexity: 17 Second operand has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 10 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2025-01-10 07:51:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:16,129 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2025-01-10 07:51:16,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. [2025-01-10 07:51:16,130 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-01-10 07:51:16,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 72 transitions. [2025-01-10 07:51:16,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-01-10 07:51:16,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-01-10 07:51:16,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 72 transitions. [2025-01-10 07:51:16,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:16,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-01-10 07:51:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 72 transitions. [2025-01-10 07:51:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-10 07:51:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 39 states have internal predecessors, (41), 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) [2025-01-10 07:51:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-01-10 07:51:16,142 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-01-10 07:51:16,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 07:51:16,143 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-01-10 07:51:16,146 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-01-10 07:51:16,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 72 transitions. [2025-01-10 07:51:16,147 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-01-10 07:51:16,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:16,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:16,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:16,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 18, 18, 12, 12, 12, 12, 12, 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, 1, 1] [2025-01-10 07:51:16,154 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:16,154 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:16,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2025-01-10 07:51:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:16,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750615828] [2025-01-10 07:51:16,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:51:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:16,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:16,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:16,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:51:16,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:16,166 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:16,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:16,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:16,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:16,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:16,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:16,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash 445681865, now seen corresponding path program 3 times [2025-01-10 07:51:16,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:16,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316775146] [2025-01-10 07:51:16,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:51:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:16,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 368 statements into 12 equivalence classes. [2025-01-10 07:51:16,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 368 statements. [2025-01-10 07:51:16,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:51:16,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2649 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2025-01-10 07:51:16,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:16,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316775146] [2025-01-10 07:51:16,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316775146] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:16,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635453960] [2025-01-10 07:51:16,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:51:16,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:16,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:16,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:16,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 07:51:16,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 368 statements into 12 equivalence classes. [2025-01-10 07:51:16,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 368 statements. [2025-01-10 07:51:16,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 07:51:16,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:16,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 07:51:16,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:16,719 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 11 treesize of output 7 [2025-01-10 07:51:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2649 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2025-01-10 07:51:16,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2649 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 2534 trivial. 0 not checked. [2025-01-10 07:51:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635453960] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:17,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:17,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 21 [2025-01-10 07:51:17,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7236556] [2025-01-10 07:51:17,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:17,525 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:17,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 07:51:17,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-01-10 07:51:17,526 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. cyclomatic complexity: 19 Second operand has 21 states, 16 states have (on average 2.875) internal successors, (46), 18 states have internal predecessors, (46), 9 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (17), 8 states have call predecessors, (17), 9 states have call successors, (17) [2025-01-10 07:51:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:17,755 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-01-10 07:51:17,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 76 transitions. [2025-01-10 07:51:17,756 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-01-10 07:51:17,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 76 transitions. [2025-01-10 07:51:17,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-01-10 07:51:17,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-01-10 07:51:17,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 76 transitions. [2025-01-10 07:51:17,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:17,758 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 76 transitions. [2025-01-10 07:51:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 76 transitions. [2025-01-10 07:51:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-10 07:51:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 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) [2025-01-10 07:51:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2025-01-10 07:51:17,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 76 transitions. [2025-01-10 07:51:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 07:51:17,762 INFO L432 stractBuchiCegarLoop]: Abstraction has 62 states and 76 transitions. [2025-01-10 07:51:17,762 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-01-10 07:51:17,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 76 transitions. [2025-01-10 07:51:17,762 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-01-10 07:51:17,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:17,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:17,767 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:17,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 72, 54, 54, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1] [2025-01-10 07:51:17,767 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:17,767 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:17,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2025-01-10 07:51:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415918938] [2025-01-10 07:51:17,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:51:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:17,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:17,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:17,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:51:17,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:17,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:17,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:17,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:17,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:17,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:17,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:17,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:17,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1755106423, now seen corresponding path program 4 times [2025-01-10 07:51:17,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:17,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499908913] [2025-01-10 07:51:17,783 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:51:17,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:17,883 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1016 statements into 2 equivalence classes. [2025-01-10 07:51:17,972 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1016 of 1016 statements. [2025-01-10 07:51:17,974 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 07:51:17,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 23061 backedges. 223 proven. 271 refuted. 0 times theorem prover too weak. 22567 trivial. 0 not checked. [2025-01-10 07:51:21,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:21,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499908913] [2025-01-10 07:51:21,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499908913] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:21,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745601807] [2025-01-10 07:51:21,371 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:51:21,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:21,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:21,375 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:21,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 07:51:21,684 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1016 statements into 2 equivalence classes. [2025-01-10 07:51:22,367 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1016 of 1016 statements. [2025-01-10 07:51:22,368 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 07:51:22,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:22,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 7028 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 07:51:22,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:22,455 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 [2025-01-10 07:51:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 23061 backedges. 11907 proven. 3 refuted. 0 times theorem prover too weak. 11151 trivial. 0 not checked. [2025-01-10 07:51:22,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 23061 backedges. 259 proven. 274 refuted. 0 times theorem prover too weak. 22528 trivial. 0 not checked. [2025-01-10 07:51:24,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745601807] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:24,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:24,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2025-01-10 07:51:24,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637047879] [2025-01-10 07:51:24,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:24,599 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:24,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 07:51:24,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-01-10 07:51:24,600 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. cyclomatic complexity: 19 Second operand has 22 states, 16 states have (on average 4.1875) internal successors, (67), 19 states have internal predecessors, (67), 11 states have call successors, (27), 5 states have call predecessors, (27), 7 states have return successors, (29), 8 states have call predecessors, (29), 11 states have call successors, (29) [2025-01-10 07:51:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:24,905 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-01-10 07:51:24,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 80 transitions. [2025-01-10 07:51:24,908 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-01-10 07:51:24,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 80 transitions. [2025-01-10 07:51:24,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-01-10 07:51:24,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-01-10 07:51:24,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 80 transitions. [2025-01-10 07:51:24,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:24,910 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 80 transitions. [2025-01-10 07:51:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 80 transitions. [2025-01-10 07:51:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 07:51:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 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) [2025-01-10 07:51:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2025-01-10 07:51:24,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 80 transitions. [2025-01-10 07:51:24,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 07:51:24,914 INFO L432 stractBuchiCegarLoop]: Abstraction has 66 states and 80 transitions. [2025-01-10 07:51:24,914 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-01-10 07:51:24,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 80 transitions. [2025-01-10 07:51:24,917 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-01-10 07:51:24,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:24,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:24,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:24,935 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [216, 216, 162, 162, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 72, 72, 54, 54, 54, 54, 54, 54, 54, 24, 24, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1] [2025-01-10 07:51:24,935 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:24,936 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:24,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times [2025-01-10 07:51:24,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:24,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249872378] [2025-01-10 07:51:24,942 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 07:51:24,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:24,949 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-01-10 07:51:24,951 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:24,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 07:51:24,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:24,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:24,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:24,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:24,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:24,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:24,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:24,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash -961990711, now seen corresponding path program 5 times [2025-01-10 07:51:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861827563] [2025-01-10 07:51:24,960 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:51:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:25,316 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2564 statements into 103 equivalence classes. [2025-01-10 07:51:25,339 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 55 of 2564 statements. [2025-01-10 07:51:25,339 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 07:51:25,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 184287 backedges. 155 proven. 3239 refuted. 0 times theorem prover too weak. 180893 trivial. 0 not checked. [2025-01-10 07:51:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861827563] [2025-01-10 07:51:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861827563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:25,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726765620] [2025-01-10 07:51:25,757 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:51:25,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:25,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:25,759 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:25,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 07:51:26,485 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2564 statements into 103 equivalence classes. [2025-01-10 07:51:26,516 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 55 of 2564 statements. [2025-01-10 07:51:26,516 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 07:51:26,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:26,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 07:51:26,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:26,582 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 [2025-01-10 07:51:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 184287 backedges. 17328 proven. 3 refuted. 0 times theorem prover too weak. 166956 trivial. 0 not checked. [2025-01-10 07:51:26,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 184287 backedges. 155 proven. 3240 refuted. 0 times theorem prover too weak. 180892 trivial. 0 not checked. [2025-01-10 07:51:32,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726765620] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:32,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:32,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2025-01-10 07:51:32,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267425518] [2025-01-10 07:51:32,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:32,885 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:32,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 07:51:32,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-01-10 07:51:32,886 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. cyclomatic complexity: 19 Second operand has 23 states, 17 states have (on average 3.764705882352941) internal successors, (64), 20 states have internal predecessors, (64), 8 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (30), 5 states have call predecessors, (30), 8 states have call successors, (30) [2025-01-10 07:51:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:33,183 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2025-01-10 07:51:33,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 84 transitions. [2025-01-10 07:51:33,184 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-01-10 07:51:33,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 84 transitions. [2025-01-10 07:51:33,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-01-10 07:51:33,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-01-10 07:51:33,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 84 transitions. [2025-01-10 07:51:33,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:33,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-01-10 07:51:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 84 transitions. [2025-01-10 07:51:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-10 07:51:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.119047619047619) internal successors, (47), 45 states have internal predecessors, (47), 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) [2025-01-10 07:51:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2025-01-10 07:51:33,195 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-01-10 07:51:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 07:51:33,198 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-01-10 07:51:33,198 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-01-10 07:51:33,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 84 transitions. [2025-01-10 07:51:33,199 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-01-10 07:51:33,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:33,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:33,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:33,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [432, 432, 324, 324, 324, 162, 162, 108, 108, 108, 108, 108, 108, 108, 72, 72, 54, 54, 54, 54, 54, 54, 54, 24, 24, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1] [2025-01-10 07:51:33,207 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:33,208 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:33,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 11 times [2025-01-10 07:51:33,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:33,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805084831] [2025-01-10 07:51:33,211 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 07:51:33,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:33,217 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:33,219 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:33,219 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:51:33,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:33,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:33,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:33,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:33,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:33,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:33,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:33,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1135021257, now seen corresponding path program 6 times [2025-01-10 07:51:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:33,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676197053] [2025-01-10 07:51:33,231 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:51:33,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:33,561 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3644 statements into 149 equivalence classes. [2025-01-10 07:51:33,622 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 164 of 3644 statements. [2025-01-10 07:51:33,623 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-01-10 07:51:33,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 510339 backedges. 477 proven. 17 refuted. 0 times theorem prover too weak. 509845 trivial. 0 not checked. [2025-01-10 07:51:34,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:51:34,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676197053] [2025-01-10 07:51:34,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676197053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:51:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415184300] [2025-01-10 07:51:34,591 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:51:34,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:51:34,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:51:34,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:51:34,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 07:51:35,573 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3644 statements into 149 equivalence classes. [2025-01-10 07:51:35,792 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 164 of 3644 statements. [2025-01-10 07:51:35,792 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-01-10 07:51:35,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:51:35,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-01-10 07:51:35,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:51:35,948 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 11 treesize of output 7 [2025-01-10 07:51:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 510339 backedges. 470 proven. 77 refuted. 0 times theorem prover too weak. 509792 trivial. 0 not checked. [2025-01-10 07:51:36,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:51:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 510339 backedges. 471 proven. 33 refuted. 0 times theorem prover too weak. 509835 trivial. 0 not checked. [2025-01-10 07:51:44,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415184300] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:51:44,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:51:44,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 18] total 34 [2025-01-10 07:51:44,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811080349] [2025-01-10 07:51:44,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:51:44,177 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-01-10 07:51:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:51:44,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-10 07:51:44,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 07:51:44,186 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. cyclomatic complexity: 19 Second operand has 34 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 29 states have internal predecessors, (60), 15 states have call successors, (23), 6 states have call predecessors, (23), 10 states have return successors, (27), 15 states have call predecessors, (27), 15 states have call successors, (27) [2025-01-10 07:51:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:51:44,586 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-01-10 07:51:44,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 88 transitions. [2025-01-10 07:51:44,587 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-01-10 07:51:44,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 88 transitions. [2025-01-10 07:51:44,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-01-10 07:51:44,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-01-10 07:51:44,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 88 transitions. [2025-01-10 07:51:44,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:51:44,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 88 transitions. [2025-01-10 07:51:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 88 transitions. [2025-01-10 07:51:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-10 07:51:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 47 states have internal predecessors, (49), 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) [2025-01-10 07:51:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2025-01-10 07:51:44,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 88 transitions. [2025-01-10 07:51:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 07:51:44,599 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 88 transitions. [2025-01-10 07:51:44,599 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-01-10 07:51:44,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 88 transitions. [2025-01-10 07:51:44,600 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-01-10 07:51:44,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:51:44,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:51:44,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:51:44,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [720, 720, 540, 540, 540, 270, 270, 180, 180, 180, 180, 180, 180, 180, 120, 120, 90, 90, 90, 90, 90, 90, 90, 36, 36, 30, 30, 30, 30, 30, 30, 30, 6, 6, 6, 6, 6, 1, 1] [2025-01-10 07:51:44,620 INFO L752 eck$LassoCheckResult]: Stem: "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);" "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#4(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#2(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;" [2025-01-10 07:51:44,622 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~a~0#1 < 6;main_~b~0#1 := 0;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume main_~b~0#1 < 6;call write~int#4(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4);" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#99#return;" "assume true;" >"#105#return;" "call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#107#return;" "assume true;" >"#107#return;" "assume true;" >"#111#return;" "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;" "call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);"< "~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);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#113#return;" "assume true;" >"#101#return;" "call #t~mem14 := read~int#4(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#103#return;" "assume true;" >"#109#return;" "main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1;" "assume !(main_~b~0#1 < 6);main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1;" [2025-01-10 07:51:44,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:44,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 12 times [2025-01-10 07:51:44,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:44,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676760592] [2025-01-10 07:51:44,628 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 07:51:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:44,638 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:44,641 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:44,641 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 07:51:44,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:44,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:51:44,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:51:44,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:51:44,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:44,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:51:44,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:51:44,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:51:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash -678290551, now seen corresponding path program 7 times [2025-01-10 07:51:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:51:44,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884206674] [2025-01-10 07:51:44,655 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 07:51:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:51:45,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6044 statements into 1 equivalence classes. [2025-01-10 07:51:48,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6044 of 6044 statements. [2025-01-10 07:51:48,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:51:48,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat