./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 48c9605d 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-?-48c9605-m [2025-02-08 14:51:31,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:51:31,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-08 14:51:31,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:51:31,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:51:31,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-08 14:51:31,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:51:31,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:51:31,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:51:31,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:51:31,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:51:31,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:51:31,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:51:31,534 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:51:31,534 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-08 14:51:31,534 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-08 14:51:31,534 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-08 14:51:31,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:51:31,535 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:51:31,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:51:31,536 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-08 14:51:31,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:51:31,536 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:51:31,536 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:51:31,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:51:31,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:51:31,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:51:31,536 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-08 14:51:31,536 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-02-08 14:51:31,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:51:31,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:51:31,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:51:31,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:51:31,826 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:51:31,827 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-02-08 14:51:33,134 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93ca30fe0/fdc6cbf28abc44449ae0e7043c59a32b/FLAGfe2cdc584 [2025-02-08 14:51:33,402 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:51:33,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2025-02-08 14:51:33,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93ca30fe0/fdc6cbf28abc44449ae0e7043c59a32b/FLAGfe2cdc584 [2025-02-08 14:51:33,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93ca30fe0/fdc6cbf28abc44449ae0e7043c59a32b [2025-02-08 14:51:33,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:51:33,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:51:33,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:51:33,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:51:33,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:51:33,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649a78e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33, skipping insertion in model container [2025-02-08 14:51:33,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:51:33,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:51:33,620 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:51:33,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:51:33,658 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:51:33,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33 WrapperNode [2025-02-08 14:51:33,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:51:33,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:51:33,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:51:33,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:51:33,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,693 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2025-02-08 14:51:33,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:51:33,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:51:33,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:51:33,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:51:33,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,732 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-02-08 14:51:33,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:51:33,754 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:51:33,754 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:51:33,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:51:33,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (1/1) ... [2025-02-08 14:51:33,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-08 14:51:33,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:51:33,790 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-02-08 14:51:33,794 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-02-08 14:51:33,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:51:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2025-02-08 14:51:33,818 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2025-02-08 14:51:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:51:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:51:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:51:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:51:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 14:51:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:51:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:51:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:51:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:51:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:51:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 14:51:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-02-08 14:51:33,819 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-02-08 14:51:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2025-02-08 14:51:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2025-02-08 14:51:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:51:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:51:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:51:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:51:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:51:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:51:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 14:51:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-02-08 14:51:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-02-08 14:51:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:51:33,924 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:51:33,926 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:51:34,164 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#e~0#1.base, main_~#e~0#1.offset);havoc main_~#e~0#1.base, main_~#e~0#1.offset;call ULTIMATE.dealloc(main_~#f~0#1.base, main_~#f~0#1.offset);havoc main_~#f~0#1.base, main_~#f~0#1.offset; [2025-02-08 14:51:34,213 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-08 14:51:34,213 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:51:34,221 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:51:34,221 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:51:34,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:51:34 BoogieIcfgContainer [2025-02-08 14:51:34,222 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:51:34,222 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-08 14:51:34,222 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-08 14:51:34,226 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-08 14:51:34,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:34,227 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.02 02:51:33" (1/3) ... [2025-02-08 14:51:34,228 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75002142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:51:34, skipping insertion in model container [2025-02-08 14:51:34,228 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:34,228 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:51:33" (2/3) ... [2025-02-08 14:51:34,228 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75002142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.02 02:51:34, skipping insertion in model container [2025-02-08 14:51:34,228 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-08 14:51:34,228 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:51:34" (3/3) ... [2025-02-08 14:51:34,229 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2025-02-08 14:51:34,267 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-08 14:51:34,267 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-08 14:51:34,267 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-08 14:51:34,267 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-08 14:51:34,267 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-08 14:51:34,267 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-08 14:51:34,267 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-08 14:51:34,267 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-08 14:51:34,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 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-02-08 14:51:34,284 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2025-02-08 14:51:34,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:34,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:34,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:34,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:51:34,288 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-08 14:51:34,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 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-02-08 14:51:34,291 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2025-02-08 14:51:34,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:34,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:34,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:34,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-08 14:51:34,295 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:34,295 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-02-08 14:51:34,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2025-02-08 14:51:34,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:34,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22725042] [2025-02-08 14:51:34,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:34,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:34,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:34,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:34,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:34,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:34,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:34,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:34,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:34,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:34,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:34,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:34,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2269, now seen corresponding path program 1 times [2025-02-08 14:51:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:34,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667295961] [2025-02-08 14:51:34,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:34,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 14:51:34,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 14:51:34,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:34,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:34,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:34,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667295961] [2025-02-08 14:51:34,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667295961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:34,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:34,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:51:34,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670701395] [2025-02-08 14:51:34,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:34,510 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:34,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:51:34,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:51:34,533 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 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-02-08 14:51:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:34,570 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2025-02-08 14:51:34,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 60 transitions. [2025-02-08 14:51:34,574 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2025-02-08 14:51:34,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 34 states and 44 transitions. [2025-02-08 14:51:34,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-02-08 14:51:34,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-02-08 14:51:34,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2025-02-08 14:51:34,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:34,590 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-02-08 14:51:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2025-02-08 14:51:34,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-02-08 14:51:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 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-02-08 14:51:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2025-02-08 14:51:34,615 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-02-08 14:51:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:51:34,619 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-02-08 14:51:34,621 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-08 14:51:34,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2025-02-08 14:51:34,622 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-08 14:51:34,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:34,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:34,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:34,625 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:51:34,625 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:34,625 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#2(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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#62#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-02-08 14:51:34,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 2 times [2025-02-08 14:51:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:34,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295606310] [2025-02-08 14:51:34,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:34,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:34,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:34,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:34,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:34,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:34,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:34,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:34,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:34,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:34,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:34,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:34,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1696624402, now seen corresponding path program 1 times [2025-02-08 14:51:34,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003626881] [2025-02-08 14:51:34,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:34,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:51:34,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:51:34,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:34,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:51:34,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:34,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003626881] [2025-02-08 14:51:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003626881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:34,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:34,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 14:51:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565973229] [2025-02-08 14:51:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:34,934 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:34,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:34,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:51:34,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:51:34,952 INFO L87 Difference]: Start difference. First operand 32 states and 41 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-02-08 14:51:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:35,179 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2025-02-08 14:51:35,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2025-02-08 14:51:35,181 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-08 14:51:35,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 43 transitions. [2025-02-08 14:51:35,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2025-02-08 14:51:35,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2025-02-08 14:51:35,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2025-02-08 14:51:35,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:35,184 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2025-02-08 14:51:35,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2025-02-08 14:51:35,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 14:51:35,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 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), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-08 14:51:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2025-02-08 14:51:35,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2025-02-08 14:51:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:35,193 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2025-02-08 14:51:35,193 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-08 14:51:35,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2025-02-08 14:51:35,194 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-08 14:51:35,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:35,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:35,194 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:35,194 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-02-08 14:51:35,195 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:35,195 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#2(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#2(~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;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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-02-08 14:51:35,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:35,195 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 3 times [2025-02-08 14:51:35,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101471189] [2025-02-08 14:51:35,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:35,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:35,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:35,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:51:35,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:35,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:35,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:35,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:35,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:35,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:35,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:35,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash 327532844, now seen corresponding path program 1 times [2025-02-08 14:51:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:35,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852268034] [2025-02-08 14:51:35,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:35,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:35,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:51:35,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:51:35,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:35,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:51:35,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:35,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852268034] [2025-02-08 14:51:35,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852268034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:35,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:35,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 14:51:35,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667818216] [2025-02-08 14:51:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:35,487 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:35,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:35,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:51:35,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:51:35,488 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 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-02-08 14:51:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:35,632 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-02-08 14:51:35,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2025-02-08 14:51:35,634 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-08 14:51:35,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. [2025-02-08 14:51:35,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-02-08 14:51:35,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-02-08 14:51:35,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2025-02-08 14:51:35,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:35,636 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-02-08 14:51:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2025-02-08 14:51:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-08 14:51:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 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), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-08 14:51:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2025-02-08 14:51:35,643 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-02-08 14:51:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:35,644 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-02-08 14:51:35,644 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-08 14:51:35,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2025-02-08 14:51:35,645 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-08 14:51:35,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:35,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:35,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:35,645 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-02-08 14:51:35,646 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:35,646 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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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-02-08 14:51:35,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 4 times [2025-02-08 14:51:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383796861] [2025-02-08 14:51:35,646 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:51:35,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:35,655 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-08 14:51:35,659 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:35,659 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:51:35,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:35,659 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:35,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:35,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:35,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:35,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:35,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:35,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:35,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2020016858, now seen corresponding path program 1 times [2025-02-08 14:51:35,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:35,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78618881] [2025-02-08 14:51:35,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:35,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:35,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 14:51:35,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 14:51:35,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:35,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 14:51:35,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:35,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78618881] [2025-02-08 14:51:35,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78618881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:35,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:35,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 14:51:35,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654695284] [2025-02-08 14:51:35,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:35,914 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:35,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:35,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:51:35,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:51:35,914 INFO L87 Difference]: Start difference. First operand 36 states and 45 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-02-08 14:51:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:36,019 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2025-02-08 14:51:36,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 47 transitions. [2025-02-08 14:51:36,020 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-08 14:51:36,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 47 transitions. [2025-02-08 14:51:36,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-02-08 14:51:36,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-02-08 14:51:36,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 47 transitions. [2025-02-08 14:51:36,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:36,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2025-02-08 14:51:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 47 transitions. [2025-02-08 14:51:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-08 14:51:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 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), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-02-08 14:51:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2025-02-08 14:51:36,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2025-02-08 14:51:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:36,031 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2025-02-08 14:51:36,031 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-08 14:51:36,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2025-02-08 14:51:36,032 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-08 14:51:36,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:36,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:36,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:36,033 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-02-08 14:51:36,033 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:36,033 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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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-02-08 14:51:36,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 5 times [2025-02-08 14:51:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189049036] [2025-02-08 14:51:36,034 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:51:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:36,043 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:36,046 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:36,047 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:36,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:36,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:36,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:36,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:36,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:36,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:36,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:36,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1932482848, now seen corresponding path program 1 times [2025-02-08 14:51:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356651590] [2025-02-08 14:51:36,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:36,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:36,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 14:51:36,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 14:51:36,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:36,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:51:36,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:36,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356651590] [2025-02-08 14:51:36,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356651590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:51:36,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:51:36,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 14:51:36,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759411991] [2025-02-08 14:51:36,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:51:36,357 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:36,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:36,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:51:36,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:51:36,358 INFO L87 Difference]: Start difference. First operand 38 states and 47 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-02-08 14:51:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:36,444 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-02-08 14:51:36,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2025-02-08 14:51:36,445 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-08 14:51:36,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2025-02-08 14:51:36,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-02-08 14:51:36,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-02-08 14:51:36,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2025-02-08 14:51:36,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:36,446 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-02-08 14:51:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2025-02-08 14:51:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 14:51:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 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), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-08 14:51:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-02-08 14:51:36,449 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-02-08 14:51:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:36,450 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-02-08 14:51:36,450 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-08 14:51:36,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2025-02-08 14:51:36,451 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-08 14:51:36,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:36,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:36,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:36,452 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-02-08 14:51:36,452 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:36,452 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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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-02-08 14:51:36,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 6 times [2025-02-08 14:51:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:36,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763316183] [2025-02-08 14:51:36,453 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:51:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:36,458 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:36,461 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:36,461 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:51:36,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:36,462 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:36,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:36,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:36,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:36,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:36,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:36,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1525386311, now seen corresponding path program 1 times [2025-02-08 14:51:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:36,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919779673] [2025-02-08 14:51:36,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:36,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 14:51:36,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 14:51:36,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:36,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:51:36,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:36,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919779673] [2025-02-08 14:51:36,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919779673] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:51:36,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123002886] [2025-02-08 14:51:36,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:51:36,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:51:36,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:51:36,538 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-02-08 14:51:36,540 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-02-08 14:51:36,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 14:51:36,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 14:51:36,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:36,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:36,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 14:51:36,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:51:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:51:36,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:51:36,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:51:36,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123002886] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:51:36,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:51:36,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 14:51:36,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329897696] [2025-02-08 14:51:36,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:51:36,849 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:36,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:51:36,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:51:36,850 INFO L87 Difference]: Start difference. First operand 40 states and 49 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-02-08 14:51:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:36,920 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2025-02-08 14:51:36,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2025-02-08 14:51:36,921 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2025-02-08 14:51:36,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 61 transitions. [2025-02-08 14:51:36,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-02-08 14:51:36,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-02-08 14:51:36,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 61 transitions. [2025-02-08 14:51:36,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:36,923 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-02-08 14:51:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 61 transitions. [2025-02-08 14:51:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 14:51:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 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-02-08 14:51:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2025-02-08 14:51:36,927 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-02-08 14:51:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:51:36,927 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 61 transitions. [2025-02-08 14:51:36,927 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-08 14:51:36,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 61 transitions. [2025-02-08 14:51:36,928 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2025-02-08 14:51:36,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:36,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:36,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:36,931 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-02-08 14:51:36,931 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:36,931 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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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-02-08 14:51:36,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:36,933 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 7 times [2025-02-08 14:51:36,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:36,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401089953] [2025-02-08 14:51:36,934 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:51:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:36,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:36,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:36,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:36,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:36,946 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:36,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:36,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:36,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:36,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:36,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:36,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:36,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1655182301, now seen corresponding path program 2 times [2025-02-08 14:51:36,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:36,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463957828] [2025-02-08 14:51:36,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:36,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:36,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-02-08 14:51:37,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 14:51:37,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:51:37,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 55 proven. 75 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-08 14:51:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:38,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463957828] [2025-02-08 14:51:38,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463957828] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:51:38,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733239791] [2025-02-08 14:51:38,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:38,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:51:38,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:51:38,211 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-02-08 14:51:38,212 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-02-08 14:51:38,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-02-08 14:51:38,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 14:51:38,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:51:38,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:38,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:51:38,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:51:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-02-08 14:51:38,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:51:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-02-08 14:51:39,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733239791] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:51:39,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:51:39,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2025-02-08 14:51:39,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018324244] [2025-02-08 14:51:39,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:51:39,079 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:39,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:39,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 14:51:39,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-08 14:51:39,080 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. cyclomatic complexity: 17 Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2025-02-08 14:51:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:39,320 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-02-08 14:51:39,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 71 transitions. [2025-02-08 14:51:39,322 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-02-08 14:51:39,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 71 transitions. [2025-02-08 14:51:39,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2025-02-08 14:51:39,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-02-08 14:51:39,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 71 transitions. [2025-02-08 14:51:39,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:39,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 71 transitions. [2025-02-08 14:51:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 71 transitions. [2025-02-08 14:51:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 14:51:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 38 states have internal predecessors, (40), 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-02-08 14:51:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2025-02-08 14:51:39,335 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 71 transitions. [2025-02-08 14:51:39,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:51:39,338 INFO L432 stractBuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2025-02-08 14:51:39,338 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-08 14:51:39,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 71 transitions. [2025-02-08 14:51:39,339 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-02-08 14:51:39,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:39,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:39,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:39,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2025-02-08 14:51:39,349 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:39,350 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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#62#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-02-08 14:51:39,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:39,350 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 8 times [2025-02-08 14:51:39,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:39,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646812706] [2025-02-08 14:51:39,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:51:39,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:39,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:39,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:39,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:39,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:39,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:39,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:39,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:39,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:39,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:39,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:39,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:39,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1957799249, now seen corresponding path program 3 times [2025-02-08 14:51:39,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:39,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-02-08 14:51:39,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:39,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:39,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 302 statements into 12 equivalence classes. [2025-02-08 14:51:39,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 302 statements. [2025-02-08 14:51:39,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:51:39,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 1542 trivial. 0 not checked. [2025-02-08 14:51:39,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:39,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-02-08 14:51:39,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967039731] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:51:39,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544489337] [2025-02-08 14:51:39,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:39,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:51:39,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:51:39,710 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-02-08 14:51:39,712 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-02-08 14:51:39,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 302 statements into 12 equivalence classes. [2025-02-08 14:51:39,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 302 statements. [2025-02-08 14:51:39,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 14:51:39,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:39,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 14:51:39,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:51:39,994 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-02-08 14:51:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 1542 trivial. 0 not checked. [2025-02-08 14:51:40,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:51:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 1541 trivial. 0 not checked. [2025-02-08 14:51:41,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544489337] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:51:41,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:51:41,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2025-02-08 14:51:41,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850443205] [2025-02-08 14:51:41,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:51:41,031 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:41,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:41,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 14:51:41,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2025-02-08 14:51:41,033 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. cyclomatic complexity: 19 Second operand has 22 states, 16 states have (on average 2.9375) internal successors, (47), 19 states have internal predecessors, (47), 10 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2025-02-08 14:51:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:41,344 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-02-08 14:51:41,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 75 transitions. [2025-02-08 14:51:41,346 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-02-08 14:51:41,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 75 transitions. [2025-02-08 14:51:41,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-02-08 14:51:41,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2025-02-08 14:51:41,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 75 transitions. [2025-02-08 14:51:41,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:41,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-02-08 14:51:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 75 transitions. [2025-02-08 14:51:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-08 14:51:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 13 states have call successors, (13), 4 states have call predecessors, (13), 11 states have return successors, (20), 16 states have call predecessors, (20), 13 states have call successors, (20) [2025-02-08 14:51:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-02-08 14:51:41,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-02-08 14:51:41,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:51:41,360 INFO L432 stractBuchiCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-02-08 14:51:41,360 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-08 14:51:41,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 75 transitions. [2025-02-08 14:51:41,361 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-02-08 14:51:41,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:41,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:41,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:41,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [54, 54, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1] [2025-02-08 14:51:41,376 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:41,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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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-02-08 14:51:41,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:41,379 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 9 times [2025-02-08 14:51:41,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:41,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789331946] [2025-02-08 14:51:41,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 14:51:41,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:41,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:41,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:41,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 14:51:41,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:41,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:41,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:41,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:41,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:41,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:41,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:41,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1322635341, now seen corresponding path program 4 times [2025-02-08 14:51:41,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:41,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992250091] [2025-02-08 14:51:41,395 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:51:41,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:41,525 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 818 statements into 2 equivalence classes. [2025-02-08 14:51:41,555 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 818 of 818 statements. [2025-02-08 14:51:41,555 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:51:41,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 13926 backedges. 123 proven. 427 refuted. 0 times theorem prover too weak. 13376 trivial. 0 not checked. [2025-02-08 14:51:45,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992250091] [2025-02-08 14:51:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992250091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:51:45,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694452761] [2025-02-08 14:51:45,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:51:45,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:51:45,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:51:45,116 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-02-08 14:51:45,117 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-02-08 14:51:45,476 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 818 statements into 2 equivalence classes. [2025-02-08 14:51:46,192 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 818 of 818 statements. [2025-02-08 14:51:46,192 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 14:51:46,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:46,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 5876 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 14:51:46,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:51:46,266 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-02-08 14:51:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 13926 backedges. 6721 proven. 3 refuted. 0 times theorem prover too weak. 7202 trivial. 0 not checked. [2025-02-08 14:51:46,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:51:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13926 backedges. 417 proven. 220 refuted. 0 times theorem prover too weak. 13289 trivial. 0 not checked. [2025-02-08 14:51:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694452761] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:51:48,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:51:48,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2025-02-08 14:51:48,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149986370] [2025-02-08 14:51:48,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:51:48,718 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:48,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:48,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 14:51:48,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-02-08 14:51:48,719 INFO L87 Difference]: Start difference. First operand 61 states and 75 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, (28), 5 states have call predecessors, (28), 7 states have return successors, (31), 8 states have call predecessors, (31), 11 states have call successors, (31) [2025-02-08 14:51:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:49,004 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-02-08 14:51:49,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 79 transitions. [2025-02-08 14:51:49,005 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-02-08 14:51:49,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 79 transitions. [2025-02-08 14:51:49,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2025-02-08 14:51:49,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2025-02-08 14:51:49,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 79 transitions. [2025-02-08 14:51:49,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:49,010 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-02-08 14:51:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 79 transitions. [2025-02-08 14:51:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 14:51:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 13 states have call successors, (13), 4 states have call predecessors, (13), 13 states have return successors, (22), 18 states have call predecessors, (22), 13 states have call successors, (22) [2025-02-08 14:51:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-02-08 14:51:49,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-02-08 14:51:49,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:51:49,015 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-02-08 14:51:49,015 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-08 14:51:49,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 79 transitions. [2025-02-08 14:51:49,016 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-02-08 14:51:49,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:49,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:49,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:49,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [162, 162, 108, 108, 108, 72, 72, 54, 54, 54, 54, 54, 54, 54, 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-02-08 14:51:49,025 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:49,026 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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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-02-08 14:51:49,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 10 times [2025-02-08 14:51:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:49,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601540091] [2025-02-08 14:51:49,028 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 14:51:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:49,033 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-08 14:51:49,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:49,037 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 14:51:49,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:49,037 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:49,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:49,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:49,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:49,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:49,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:49,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1139494227, now seen corresponding path program 5 times [2025-02-08 14:51:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:49,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10230809] [2025-02-08 14:51:49,046 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:51:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:49,244 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1574 statements into 80 equivalence classes. [2025-02-08 14:51:49,265 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 1574 statements. [2025-02-08 14:51:49,265 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 14:51:49,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 77052 backedges. 172 proven. 2494 refuted. 0 times theorem prover too weak. 74386 trivial. 0 not checked. [2025-02-08 14:51:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10230809] [2025-02-08 14:51:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10230809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:51:49,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070714640] [2025-02-08 14:51:49,592 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:51:49,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:51:49,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:51:49,598 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-02-08 14:51:49,602 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-02-08 14:51:50,221 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1574 statements into 80 equivalence classes. [2025-02-08 14:51:50,267 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 1574 statements. [2025-02-08 14:51:50,267 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 14:51:50,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:50,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 14:51:50,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:51:50,344 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-02-08 14:51:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 77052 backedges. 12529 proven. 12 refuted. 0 times theorem prover too weak. 64511 trivial. 0 not checked. [2025-02-08 14:51:50,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:51:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 77052 backedges. 225 proven. 2584 refuted. 0 times theorem prover too weak. 74243 trivial. 0 not checked. [2025-02-08 14:51:55,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070714640] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:51:55,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:51:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 14] total 27 [2025-02-08 14:51:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780526614] [2025-02-08 14:51:55,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:51:55,526 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:51:55,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:51:55,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 14:51:55,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2025-02-08 14:51:55,527 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. cyclomatic complexity: 19 Second operand has 27 states, 20 states have (on average 3.4) internal successors, (68), 23 states have internal predecessors, (68), 10 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (34), 6 states have call predecessors, (34), 10 states have call successors, (34) [2025-02-08 14:51:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:51:55,772 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2025-02-08 14:51:55,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 81 transitions. [2025-02-08 14:51:55,774 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-02-08 14:51:55,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 81 transitions. [2025-02-08 14:51:55,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-02-08 14:51:55,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-02-08 14:51:55,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 81 transitions. [2025-02-08 14:51:55,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:51:55,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-02-08 14:51:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 81 transitions. [2025-02-08 14:51:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-08 14:51:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 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), 14 states have return successors, (23), 19 states have call predecessors, (23), 13 states have call successors, (23) [2025-02-08 14:51:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-02-08 14:51:55,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-02-08 14:51:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:51:55,780 INFO L432 stractBuchiCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-02-08 14:51:55,780 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-08 14:51:55,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 81 transitions. [2025-02-08 14:51:55,781 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-02-08 14:51:55,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:51:55,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:51:55,788 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:51:55,788 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [216, 216, 162, 162, 162, 72, 72, 54, 54, 54, 54, 54, 54, 54, 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-02-08 14:51:55,788 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:51:55,789 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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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-02-08 14:51:55,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 11 times [2025-02-08 14:51:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586046916] [2025-02-08 14:51:55,791 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 14:51:55,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:55,797 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:55,799 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:55,799 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:51:55,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:55,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:51:55,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:51:55,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:51:55,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:51:55,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:51:55,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:51:55,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:51:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1043650909, now seen corresponding path program 6 times [2025-02-08 14:51:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:51:55,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29176124] [2025-02-08 14:51:55,805 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:51:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:51:56,019 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1844 statements into 96 equivalence classes. [2025-02-08 14:51:56,042 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 90 of 1844 statements. [2025-02-08 14:51:56,043 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-08 14:51:56,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 125031 backedges. 511 proven. 3 refuted. 0 times theorem prover too weak. 124517 trivial. 0 not checked. [2025-02-08 14:51:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:51:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29176124] [2025-02-08 14:51:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29176124] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:51:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101842856] [2025-02-08 14:51:56,391 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:51:56,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:51:56,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:51:56,393 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-02-08 14:51:56,396 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-02-08 14:51:57,084 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1844 statements into 96 equivalence classes. [2025-02-08 14:51:57,218 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 90 of 1844 statements. [2025-02-08 14:51:57,219 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-08 14:51:57,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:51:57,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 14:51:57,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:51:57,367 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-02-08 14:51:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 125031 backedges. 613 proven. 3 refuted. 0 times theorem prover too weak. 124415 trivial. 0 not checked. [2025-02-08 14:51:57,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:52:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 125031 backedges. 511 proven. 4 refuted. 0 times theorem prover too weak. 124516 trivial. 0 not checked. [2025-02-08 14:52:02,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101842856] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:52:02,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:52:02,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2025-02-08 14:52:02,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443377090] [2025-02-08 14:52:02,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:52:02,216 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-08 14:52:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:52:02,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 14:52:02,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-02-08 14:52:02,217 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. cyclomatic complexity: 19 Second operand has 23 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 20 states have internal predecessors, (52), 11 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2025-02-08 14:52:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 14:52:02,518 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2025-02-08 14:52:02,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 85 transitions. [2025-02-08 14:52:02,519 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-02-08 14:52:02,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 85 transitions. [2025-02-08 14:52:02,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2025-02-08 14:52:02,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2025-02-08 14:52:02,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2025-02-08 14:52:02,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-08 14:52:02,521 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-02-08 14:52:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2025-02-08 14:52:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-08 14:52:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 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), 16 states have return successors, (25), 21 states have call predecessors, (25), 13 states have call successors, (25) [2025-02-08 14:52:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2025-02-08 14:52:02,525 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-02-08 14:52:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 14:52:02,526 INFO L432 stractBuchiCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-02-08 14:52:02,526 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-08 14:52:02,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 85 transitions. [2025-02-08 14:52:02,527 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 38 [2025-02-08 14:52:02,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-08 14:52:02,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-08 14:52:02,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-08 14:52:02,543 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [648, 648, 486, 486, 486, 216, 216, 162, 162, 162, 162, 162, 162, 162, 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-02-08 14:52:02,543 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#2(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0;" [2025-02-08 14:52:02,545 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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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#2(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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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#4(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#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~f.base, ~f.offset, 4);" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);"< "~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#3(~f.base, ~f.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#52#return;" "assume true;" >"#60#return;" "call #t~mem8 := read~int#4(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#58#return;" "assume true;" >"#66#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;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#64#return;" "assume true;" >"#56#return;" "call #t~mem14 := read~int#2(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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#2(~c.base, ~c.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#54#return;" "assume true;" >"#62#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-02-08 14:52:02,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:52:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 12 times [2025-02-08 14:52:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:52:02,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733163330] [2025-02-08 14:52:02,549 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 14:52:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:52:02,555 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:52:02,557 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:52:02,557 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 14:52:02,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:52:02,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:52:02,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-08 14:52:02,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-08 14:52:02,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:02,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:52:02,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:52:02,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:52:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash 46633437, now seen corresponding path program 7 times [2025-02-08 14:52:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:52:02,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844143637] [2025-02-08 14:52:02,571 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 14:52:02,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:52:03,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5048 statements into 1 equivalence classes. [2025-02-08 14:52:06,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5048 of 5048 statements. [2025-02-08 14:52:06,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:52:06,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat