./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:19:36,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:19:36,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:19:36,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:19:36,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:19:36,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:19:36,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:19:36,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:19:36,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:19:36,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:19:36,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:19:36,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:19:36,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:19:36,580 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:19:36,580 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:19:36,580 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:19:36,580 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:19:36,580 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:19:36,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:19:36,581 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:19:36,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:19:36,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:19:36,582 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:19:36,582 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:19:36,582 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:19:36,582 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:19:36,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:19:36,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:19:36,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:19:36,582 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:19:36,582 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/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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2025-03-04 16:19:36,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:19:36,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:19:36,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:19:36,811 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:19:36,811 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:19:36,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-03-04 16:19:37,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6cf2fbbe/cc1c897706cb4e1395512bbe8f96464f/FLAG0fa70fe25 [2025-03-04 16:19:38,220 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:19:38,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-03-04 16:19:38,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6cf2fbbe/cc1c897706cb4e1395512bbe8f96464f/FLAG0fa70fe25 [2025-03-04 16:19:38,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6cf2fbbe/cc1c897706cb4e1395512bbe8f96464f [2025-03-04 16:19:38,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:19:38,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:19:38,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:19:38,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:19:38,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:19:38,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c66e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38, skipping insertion in model container [2025-03-04 16:19:38,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:19:38,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:19:38,706 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:19:38,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:19:38,740 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:19:38,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38 WrapperNode [2025-03-04 16:19:38,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:19:38,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:19:38,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:19:38,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:19:38,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,768 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-03-04 16:19:38,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:19:38,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:19:38,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:19:38,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:19:38,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,800 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2025-03-04 16:19:38,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:19:38,818 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:19:38,818 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:19:38,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:19:38,819 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (1/1) ... [2025-03-04 16:19:38,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:19:38,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:38,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:19:38,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 16:19:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:19:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:19:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 16:19:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 16:19:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 16:19:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 16:19:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 16:19:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 16:19:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 16:19:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 16:19:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 16:19:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 16:19:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 16:19:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 16:19:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-03-04 16:19:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-03-04 16:19:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-03-04 16:19:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-03-04 16:19:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-03-04 16:19:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-03-04 16:19:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:19:38,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:19:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 16:19:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 16:19:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 16:19:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 16:19:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 16:19:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 16:19:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2025-03-04 16:19:38,880 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2025-03-04 16:19:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-03-04 16:19:38,880 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-03-04 16:19:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 16:19:38,986 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:19:38,988 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:19:39,195 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;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; [2025-03-04 16:19:39,220 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-04 16:19:39,221 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:19:39,230 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:19:39,230 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:19:39,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:19:39 BoogieIcfgContainer [2025-03-04 16:19:39,232 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:19:39,233 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:19:39,233 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:19:39,237 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:19:39,237 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:19:39,237 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:19:38" (1/3) ... [2025-03-04 16:19:39,239 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@185f34b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:19:39, skipping insertion in model container [2025-03-04 16:19:39,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:19:39,239 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:19:38" (2/3) ... [2025-03-04 16:19:39,239 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@185f34b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:19:39, skipping insertion in model container [2025-03-04 16:19:39,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:19:39,239 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:19:39" (3/3) ... [2025-03-04 16:19:39,240 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2025-03-04 16:19:39,284 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:19:39,285 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:19:39,285 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:19:39,285 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:19:39,285 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:19:39,285 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:19:39,285 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:19:39,285 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:19:39,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 16:19:39,307 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:39,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:39,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:39,313 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:39,313 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:39,314 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:19:39,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 16:19:39,319 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:39,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:39,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:39,320 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:39,320 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:39,325 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:39,325 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:39,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:39,330 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 1 times [2025-03-04 16:19:39,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:39,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825770324] [2025-03-04 16:19:39,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:39,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:39,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:39,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:39,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:39,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:39,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:39,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:39,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:39,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:39,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:39,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:39,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:39,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1768289610, now seen corresponding path program 1 times [2025-03-04 16:19:39,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:39,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180433961] [2025-03-04 16:19:39,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:39,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 16:19:39,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 16:19:39,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:39,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:19:39,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:39,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180433961] [2025-03-04 16:19:39,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180433961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:19:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:19:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:19:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348246263] [2025-03-04 16:19:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:19:39,841 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:39,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:39,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:19:39,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:19:39,861 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 16:19:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:40,072 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-03-04 16:19:40,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2025-03-04 16:19:40,077 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:40,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 44 transitions. [2025-03-04 16:19:40,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-04 16:19:40,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-04 16:19:40,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2025-03-04 16:19:40,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:40,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-03-04 16:19:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2025-03-04 16:19:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 16:19:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-04 16:19:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-03-04 16:19:40,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-03-04 16:19:40,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:19:40,111 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-03-04 16:19:40,111 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:19:40,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2025-03-04 16:19:40,112 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:40,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:40,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:40,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:40,113 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-03-04 16:19:40,113 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:40,113 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:40,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 2 times [2025-03-04 16:19:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:40,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245054651] [2025-03-04 16:19:40,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:40,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:40,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:40,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:40,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:19:40,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:40,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:40,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:40,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:40,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:40,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:40,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:40,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash 413766199, now seen corresponding path program 1 times [2025-03-04 16:19:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289477161] [2025-03-04 16:19:40,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:40,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 16:19:40,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 16:19:40,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:40,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 16:19:40,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289477161] [2025-03-04 16:19:40,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289477161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:19:40,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:19:40,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:19:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062070172] [2025-03-04 16:19:40,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:19:40,367 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:40,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:19:40,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:19:40,368 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 16:19:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:40,519 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-03-04 16:19:40,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2025-03-04 16:19:40,520 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:40,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 46 transitions. [2025-03-04 16:19:40,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-04 16:19:40,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-04 16:19:40,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2025-03-04 16:19:40,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:40,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-04 16:19:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2025-03-04 16:19:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 16:19:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 26 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-04 16:19:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-04 16:19:40,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-04 16:19:40,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:19:40,528 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-04 16:19:40,528 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:19:40,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2025-03-04 16:19:40,529 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:40,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:40,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:40,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:40,530 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-03-04 16:19:40,530 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:40,530 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:40,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:40,531 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 3 times [2025-03-04 16:19:40,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:40,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418546907] [2025-03-04 16:19:40,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:40,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:40,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:40,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:19:40,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:40,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:40,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:40,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:40,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:40,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:40,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:40,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:40,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1401246586, now seen corresponding path program 1 times [2025-03-04 16:19:40,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:40,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74985999] [2025-03-04 16:19:40,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:40,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 16:19:40,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 16:19:40,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:40,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 16:19:40,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:40,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74985999] [2025-03-04 16:19:40,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74985999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:19:40,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:19:40,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:19:40,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399749940] [2025-03-04 16:19:40,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:19:40,732 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:40,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:40,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:19:40,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:19:40,734 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 16:19:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:40,844 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-03-04 16:19:40,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2025-03-04 16:19:40,845 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:40,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 48 transitions. [2025-03-04 16:19:40,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-03-04 16:19:40,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-04 16:19:40,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2025-03-04 16:19:40,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:40,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-04 16:19:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2025-03-04 16:19:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-04 16:19:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-04 16:19:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-04 16:19:40,851 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-04 16:19:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:19:40,852 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-04 16:19:40,853 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:19:40,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2025-03-04 16:19:40,853 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:40,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:40,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:40,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:40,854 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-03-04 16:19:40,854 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:40,854 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:40,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:40,855 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 4 times [2025-03-04 16:19:40,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:40,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374134893] [2025-03-04 16:19:40,855 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:40,873 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 16:19:40,882 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:40,882 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:19:40,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:40,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:40,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:40,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:40,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:40,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:40,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:40,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash 197511696, now seen corresponding path program 1 times [2025-03-04 16:19:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:40,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202447548] [2025-03-04 16:19:40,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:40,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:40,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 16:19:40,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 16:19:40,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:40,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 16:19:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202447548] [2025-03-04 16:19:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202447548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:19:41,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:19:41,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 16:19:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977043850] [2025-03-04 16:19:41,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:19:41,118 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:41,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 16:19:41,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 16:19:41,119 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 16:19:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:41,205 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-03-04 16:19:41,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2025-03-04 16:19:41,206 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:41,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2025-03-04 16:19:41,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-03-04 16:19:41,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-04 16:19:41,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2025-03-04 16:19:41,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:41,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-04 16:19:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2025-03-04 16:19:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 16:19:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 28 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 16:19:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-03-04 16:19:41,213 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-04 16:19:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 16:19:41,214 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-04 16:19:41,214 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:19:41,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2025-03-04 16:19:41,215 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:41,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:41,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:41,216 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:41,216 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-03-04 16:19:41,216 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:41,217 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:41,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 5 times [2025-03-04 16:19:41,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:41,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990228033] [2025-03-04 16:19:41,217 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:19:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:41,223 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:41,228 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:41,228 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:19:41,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:41,228 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:41,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:41,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:41,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:41,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:41,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:41,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:41,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1731545009, now seen corresponding path program 1 times [2025-03-04 16:19:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:41,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468853970] [2025-03-04 16:19:41,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:41,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 16:19:41,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 16:19:41,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:41,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 16:19:41,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:41,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468853970] [2025-03-04 16:19:41,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468853970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:41,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910775264] [2025-03-04 16:19:41,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:19:41,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:41,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:41,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:41,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 16:19:41,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 16:19:41,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 16:19:41,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:41,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:41,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 16:19:41,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:41,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:19:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 16:19:42,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 16:19:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910775264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:42,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:42,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2025-03-04 16:19:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173311908] [2025-03-04 16:19:42,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:42,569 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:42,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 16:19:42,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-03-04 16:19:42,570 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 24 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 20 states have internal predecessors, (51), 10 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-04 16:19:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:43,131 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-03-04 16:19:43,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2025-03-04 16:19:43,132 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:43,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2025-03-04 16:19:43,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-03-04 16:19:43,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-03-04 16:19:43,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2025-03-04 16:19:43,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:43,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-03-04 16:19:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2025-03-04 16:19:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-04 16:19:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-04 16:19:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-03-04 16:19:43,138 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-03-04 16:19:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 16:19:43,140 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-03-04 16:19:43,141 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 16:19:43,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2025-03-04 16:19:43,141 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:43,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:43,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:43,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:43,145 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:43,145 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:43,145 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:43,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:43,146 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 6 times [2025-03-04 16:19:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052142146] [2025-03-04 16:19:43,149 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:19:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:43,156 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:43,165 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:43,165 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 16:19:43,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:43,165 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:43,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:43,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:43,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:43,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:43,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash 287260773, now seen corresponding path program 2 times [2025-03-04 16:19:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442458848] [2025-03-04 16:19:43,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:43,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-04 16:19:43,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 16:19:43,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:19:43,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 57 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 16:19:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442458848] [2025-03-04 16:19:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442458848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25573461] [2025-03-04 16:19:43,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:43,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:43,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:43,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:43,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 16:19:43,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-04 16:19:44,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 16:19:44,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:19:44,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:44,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-04 16:19:44,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:44,103 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-03-04 16:19:44,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 16:19:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 16:19:44,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 16:19:45,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25573461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:45,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:45,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 32 [2025-03-04 16:19:45,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241017938] [2025-03-04 16:19:45,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:45,583 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:45,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:45,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 16:19:45,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2025-03-04 16:19:45,584 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 32 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 28 states have internal predecessors, (70), 12 states have call successors, (27), 6 states have call predecessors, (27), 9 states have return successors, (28), 7 states have call predecessors, (28), 12 states have call successors, (28) [2025-03-04 16:19:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:45,951 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-03-04 16:19:45,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2025-03-04 16:19:45,952 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:45,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2025-03-04 16:19:45,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-03-04 16:19:45,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-03-04 16:19:45,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2025-03-04 16:19:45,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:45,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-03-04 16:19:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2025-03-04 16:19:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 16:19:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-04 16:19:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-03-04 16:19:45,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-03-04 16:19:45,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 16:19:45,963 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-03-04 16:19:45,963 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 16:19:45,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2025-03-04 16:19:45,963 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:45,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:45,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:45,965 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:45,965 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 8, 8, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:45,965 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:45,965 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:45,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:45,965 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 7 times [2025-03-04 16:19:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351037296] [2025-03-04 16:19:45,969 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 16:19:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:45,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:45,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:45,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:45,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:45,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:45,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:45,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:45,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:45,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:45,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:45,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:45,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2109703393, now seen corresponding path program 3 times [2025-03-04 16:19:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:45,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317745411] [2025-03-04 16:19:45,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:45,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:46,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 9 equivalence classes. [2025-03-04 16:19:46,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 104 statements. [2025-03-04 16:19:46,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 16:19:46,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2025-03-04 16:19:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317745411] [2025-03-04 16:19:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317745411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880921797] [2025-03-04 16:19:46,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:46,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:46,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:46,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:46,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 16:19:46,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 9 equivalence classes. [2025-03-04 16:19:46,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 104 statements. [2025-03-04 16:19:46,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 16:19:46,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:46,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 16:19:46,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:46,358 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-03-04 16:19:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2025-03-04 16:19:46,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-04 16:19:46,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880921797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:46,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:46,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 20 [2025-03-04 16:19:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291894442] [2025-03-04 16:19:46,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:46,826 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:46,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 16:19:46,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-04 16:19:46,826 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 20 states, 15 states have (on average 2.466666666666667) internal successors, (37), 17 states have internal predecessors, (37), 9 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-04 16:19:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:47,029 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-03-04 16:19:47,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2025-03-04 16:19:47,030 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:47,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2025-03-04 16:19:47,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-03-04 16:19:47,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2025-03-04 16:19:47,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2025-03-04 16:19:47,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:47,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-03-04 16:19:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2025-03-04 16:19:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 16:19:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 33 states have internal predecessors, (33), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-04 16:19:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2025-03-04 16:19:47,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-03-04 16:19:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 16:19:47,037 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-03-04 16:19:47,037 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 16:19:47,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2025-03-04 16:19:47,037 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:47,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:47,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:47,041 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:47,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 16, 16, 16, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:47,041 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:47,042 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:47,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:47,042 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 8 times [2025-03-04 16:19:47,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:47,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357155761] [2025-03-04 16:19:47,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:19:47,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:47,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:47,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:47,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:19:47,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:47,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:47,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:47,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:47,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:47,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:47,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:47,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash 771604444, now seen corresponding path program 4 times [2025-03-04 16:19:47,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:47,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411904766] [2025-03-04 16:19:47,066 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:47,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:47,088 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 199 statements into 2 equivalence classes. [2025-03-04 16:19:47,104 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 16:19:47,104 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 16:19:47,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2025-03-04 16:19:47,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411904766] [2025-03-04 16:19:47,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411904766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599077692] [2025-03-04 16:19:47,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:47,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:47,804 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:47,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 16:19:47,900 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 199 statements into 2 equivalence classes. [2025-03-04 16:19:48,013 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 16:19:48,013 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 16:19:48,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:48,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-04 16:19:48,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:48,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:19:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 53 proven. 12 refuted. 0 times theorem prover too weak. 1038 trivial. 0 not checked. [2025-03-04 16:19:48,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 55 proven. 15 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2025-03-04 16:19:49,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599077692] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:49,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:49,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 14] total 31 [2025-03-04 16:19:49,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78498351] [2025-03-04 16:19:49,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:49,408 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:49,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:49,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 16:19:49,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2025-03-04 16:19:49,409 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand has 31 states, 24 states have (on average 2.625) internal successors, (63), 26 states have internal predecessors, (63), 15 states have call successors, (27), 7 states have call predecessors, (27), 10 states have return successors, (28), 13 states have call predecessors, (28), 15 states have call successors, (28) [2025-03-04 16:19:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:49,922 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2025-03-04 16:19:49,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 64 transitions. [2025-03-04 16:19:49,923 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:49,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 64 transitions. [2025-03-04 16:19:49,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2025-03-04 16:19:49,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2025-03-04 16:19:49,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2025-03-04 16:19:49,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:49,924 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-03-04 16:19:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2025-03-04 16:19:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 16:19:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 5 states have call predecessors, (10), 15 states have return successors, (19), 15 states have call predecessors, (19), 8 states have call successors, (19) [2025-03-04 16:19:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2025-03-04 16:19:49,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-03-04 16:19:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 16:19:49,930 INFO L432 stractBuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-03-04 16:19:49,930 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-04 16:19:49,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2025-03-04 16:19:49,931 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:49,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:49,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:49,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:49,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [60, 60, 48, 48, 48, 18, 18, 12, 12, 12, 12, 12, 12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:49,936 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:49,936 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:49,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:49,939 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 9 times [2025-03-04 16:19:49,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:49,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343963141] [2025-03-04 16:19:49,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:19:49,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:49,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:49,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:49,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:19:49,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:49,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:49,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:49,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:49,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:49,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:49,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:49,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1356106074, now seen corresponding path program 5 times [2025-03-04 16:19:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:49,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297508658] [2025-03-04 16:19:49,958 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:19:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:49,995 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 469 statements into 12 equivalence classes. [2025-03-04 16:19:50,043 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 186 of 469 statements. [2025-03-04 16:19:50,043 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 16:19:50,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9190 backedges. 18 proven. 1383 refuted. 0 times theorem prover too weak. 7789 trivial. 0 not checked. [2025-03-04 16:19:51,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297508658] [2025-03-04 16:19:51,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297508658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912301662] [2025-03-04 16:19:51,167 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:19:51,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:51,197 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:51,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 16:19:51,367 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 469 statements into 12 equivalence classes. [2025-03-04 16:19:52,051 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 186 of 469 statements. [2025-03-04 16:19:52,051 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 16:19:52,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:52,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-04 16:19:52,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:52,070 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-03-04 16:19:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9190 backedges. 1345 proven. 24 refuted. 0 times theorem prover too weak. 7821 trivial. 0 not checked. [2025-03-04 16:19:52,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9190 backedges. 14 proven. 1405 refuted. 0 times theorem prover too weak. 7771 trivial. 0 not checked. [2025-03-04 16:19:55,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912301662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:55,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:55,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 22] total 35 [2025-03-04 16:19:55,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436478697] [2025-03-04 16:19:55,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:55,003 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:55,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:55,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 16:19:55,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=926, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 16:19:55,005 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. cyclomatic complexity: 13 Second operand has 35 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 29 states have internal predecessors, (72), 10 states have call successors, (27), 8 states have call predecessors, (27), 12 states have return successors, (35), 10 states have call predecessors, (35), 10 states have call successors, (35) [2025-03-04 16:19:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:55,224 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2025-03-04 16:19:55,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2025-03-04 16:19:55,225 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:55,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2025-03-04 16:19:55,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-03-04 16:19:55,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-03-04 16:19:55,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2025-03-04 16:19:55,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:55,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-03-04 16:19:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2025-03-04 16:19:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 16:19:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 5 states have call predecessors, (10), 16 states have return successors, (20), 16 states have call predecessors, (20), 8 states have call successors, (20) [2025-03-04 16:19:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-03-04 16:19:55,230 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-03-04 16:19:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 16:19:55,231 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-03-04 16:19:55,232 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-04 16:19:55,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2025-03-04 16:19:55,232 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:55,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:55,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:55,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:55,239 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 72, 60, 60, 60, 18, 18, 12, 12, 12, 12, 12, 12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:55,239 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:55,239 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:55,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:55,240 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 10 times [2025-03-04 16:19:55,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:55,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062900756] [2025-03-04 16:19:55,240 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:19:55,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:55,245 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-03-04 16:19:55,250 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:55,250 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:19:55,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:55,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:55,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:55,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:55,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:55,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:55,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1171053826, now seen corresponding path program 6 times [2025-03-04 16:19:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414661644] [2025-03-04 16:19:55,258 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:19:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:55,307 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 529 statements into 13 equivalence classes. [2025-03-04 16:19:55,318 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 67 of 529 statements. [2025-03-04 16:19:55,319 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 16:19:55,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 12976 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 12964 trivial. 0 not checked. [2025-03-04 16:19:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:19:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414661644] [2025-03-04 16:19:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414661644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:19:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894643583] [2025-03-04 16:19:55,630 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:19:55,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:19:55,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:19:55,632 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:19:55,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 16:19:55,843 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 529 statements into 13 equivalence classes. [2025-03-04 16:19:55,898 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 67 of 529 statements. [2025-03-04 16:19:55,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-04 16:19:55,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:19:55,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 16:19:55,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:19:55,916 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-03-04 16:19:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12976 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12968 trivial. 0 not checked. [2025-03-04 16:19:56,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:19:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12976 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12961 trivial. 0 not checked. [2025-03-04 16:19:57,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894643583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:19:57,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:19:57,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 28 [2025-03-04 16:19:57,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226616533] [2025-03-04 16:19:57,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:19:57,661 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:19:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:19:57,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 16:19:57,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-03-04 16:19:57,665 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 28 states, 20 states have (on average 2.25) internal successors, (45), 24 states have internal predecessors, (45), 14 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2025-03-04 16:19:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:19:57,980 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2025-03-04 16:19:57,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 70 transitions. [2025-03-04 16:19:57,981 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:57,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 70 transitions. [2025-03-04 16:19:57,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-03-04 16:19:57,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-03-04 16:19:57,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2025-03-04 16:19:57,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:19:57,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-03-04 16:19:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2025-03-04 16:19:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 16:19:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 5 states have call predecessors, (10), 18 states have return successors, (22), 18 states have call predecessors, (22), 8 states have call successors, (22) [2025-03-04 16:19:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-03-04 16:19:57,987 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-03-04 16:19:57,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 16:19:57,987 INFO L432 stractBuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-03-04 16:19:57,987 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-04 16:19:57,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 70 transitions. [2025-03-04 16:19:57,988 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:19:57,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:19:57,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:19:57,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:19:57,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [144, 144, 120, 120, 120, 36, 36, 24, 24, 24, 24, 24, 24, 24, 16, 16, 12, 12, 12, 12, 12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:19:57,994 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:19:57,994 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:19:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 11 times [2025-03-04 16:19:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206412310] [2025-03-04 16:19:57,996 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:19:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:58,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:58,008 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:58,009 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:19:58,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:58,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:19:58,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:19:58,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:19:58,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:58,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:19:58,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:19:58,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:19:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash 117744462, now seen corresponding path program 7 times [2025-03-04 16:19:58,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:19:58,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761749252] [2025-03-04 16:19:58,017 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 16:19:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:19:58,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1049 statements into 1 equivalence classes. [2025-03-04 16:19:58,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1049 of 1049 statements. [2025-03-04 16:19:58,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:19:58,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 52408 backedges. 185 proven. 436 refuted. 0 times theorem prover too weak. 51787 trivial. 0 not checked. [2025-03-04 16:20:02,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:20:02,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761749252] [2025-03-04 16:20:02,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761749252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:20:02,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947202671] [2025-03-04 16:20:02,076 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 16:20:02,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:20:02,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:02,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:20:02,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 16:20:02,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1049 statements into 1 equivalence classes. [2025-03-04 16:20:02,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1049 of 1049 statements. [2025-03-04 16:20:02,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:02,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:02,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 6324 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 16:20:02,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:02,979 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-03-04 16:20:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 52408 backedges. 8016 proven. 8 refuted. 0 times theorem prover too weak. 44384 trivial. 0 not checked. [2025-03-04 16:20:03,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:20:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 52408 backedges. 14 proven. 606 refuted. 0 times theorem prover too weak. 51788 trivial. 0 not checked. [2025-03-04 16:20:06,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947202671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:20:06,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:20:06,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 28 [2025-03-04 16:20:06,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665080355] [2025-03-04 16:20:06,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:20:06,527 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:20:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:20:06,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 16:20:06,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2025-03-04 16:20:06,529 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. cyclomatic complexity: 13 Second operand has 28 states, 20 states have (on average 3.5) internal successors, (70), 24 states have internal predecessors, (70), 14 states have call successors, (30), 6 states have call predecessors, (30), 9 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2025-03-04 16:20:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:20:06,769 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-03-04 16:20:06,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2025-03-04 16:20:06,770 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:20:06,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 74 transitions. [2025-03-04 16:20:06,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-03-04 16:20:06,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-03-04 16:20:06,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2025-03-04 16:20:06,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:20:06,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-03-04 16:20:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2025-03-04 16:20:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 16:20:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 10 states have call successors, (10), 5 states have call predecessors, (10), 20 states have return successors, (24), 20 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-04 16:20:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2025-03-04 16:20:06,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-03-04 16:20:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 16:20:06,778 INFO L432 stractBuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-03-04 16:20:06,779 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-04 16:20:06,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 74 transitions. [2025-03-04 16:20:06,780 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:20:06,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:20:06,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:20:06,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:20:06,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [288, 288, 240, 240, 240, 60, 60, 48, 48, 48, 48, 48, 48, 48, 16, 16, 12, 12, 12, 12, 12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:20:06,785 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:20:06,785 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:20:06,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:06,787 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 12 times [2025-03-04 16:20:06,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:06,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575954134] [2025-03-04 16:20:06,787 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 16:20:06,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:06,792 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:06,795 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:06,795 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 16:20:06,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:06,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:06,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:06,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:06,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:06,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:06,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:06,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1120013526, now seen corresponding path program 8 times [2025-03-04 16:20:06,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:06,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367297969] [2025-03-04 16:20:06,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:20:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:06,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1913 statements into 2 equivalence classes. [2025-03-04 16:20:07,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1913 of 1913 statements. [2025-03-04 16:20:07,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:20:07,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 205192 backedges. 1290 proven. 503 refuted. 0 times theorem prover too weak. 203399 trivial. 0 not checked. [2025-03-04 16:20:21,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:20:21,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367297969] [2025-03-04 16:20:21,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367297969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:20:21,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68267537] [2025-03-04 16:20:21,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:20:21,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:20:21,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:21,306 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:20:21,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 16:20:21,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1913 statements into 2 equivalence classes. [2025-03-04 16:20:22,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1913 of 1913 statements. [2025-03-04 16:20:22,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 16:20:22,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:22,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 11100 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-04 16:20:22,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:22,854 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-03-04 16:20:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 205192 backedges. 8160 proven. 35 refuted. 0 times theorem prover too weak. 196997 trivial. 0 not checked. [2025-03-04 16:20:23,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:20:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 205192 backedges. 22 proven. 8316 refuted. 0 times theorem prover too weak. 196854 trivial. 0 not checked. [2025-03-04 16:20:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68267537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:20:30,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:20:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 26] total 48 [2025-03-04 16:20:30,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680254515] [2025-03-04 16:20:30,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:20:30,288 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:20:30,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:20:30,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 16:20:30,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1923, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 16:20:30,289 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. cyclomatic complexity: 13 Second operand has 48 states, 38 states have (on average 2.210526315789474) internal successors, (84), 40 states have internal predecessors, (84), 14 states have call successors, (32), 10 states have call predecessors, (32), 19 states have return successors, (41), 18 states have call predecessors, (41), 14 states have call successors, (41) [2025-03-04 16:20:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:20:30,924 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2025-03-04 16:20:30,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 78 transitions. [2025-03-04 16:20:30,925 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:20:30,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 78 transitions. [2025-03-04 16:20:30,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-03-04 16:20:30,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2025-03-04 16:20:30,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 78 transitions. [2025-03-04 16:20:30,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:20:30,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-03-04 16:20:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 78 transitions. [2025-03-04 16:20:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-04 16:20:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 38 states have (on average 1.105263157894737) internal successors, (42), 42 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 22 states have return successors, (26), 22 states have call predecessors, (26), 8 states have call successors, (26) [2025-03-04 16:20:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2025-03-04 16:20:30,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-03-04 16:20:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 16:20:30,936 INFO L432 stractBuchiCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-03-04 16:20:30,936 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-04 16:20:30,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 78 transitions. [2025-03-04 16:20:30,937 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:20:30,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:20:30,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:20:30,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:20:30,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [420, 420, 360, 360, 360, 72, 72, 60, 60, 60, 60, 60, 60, 60, 16, 16, 12, 12, 12, 12, 12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:20:30,942 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:20:30,943 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:20:30,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:30,945 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 13 times [2025-03-04 16:20:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313115784] [2025-03-04 16:20:30,945 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 16:20:30,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:30,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:30,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:30,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:30,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:30,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:30,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:30,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:30,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:30,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:30,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:30,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash -827234366, now seen corresponding path program 9 times [2025-03-04 16:20:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:30,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309431043] [2025-03-04 16:20:30,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:20:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:31,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2645 statements into 93 equivalence classes. [2025-03-04 16:20:31,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 159 of 2645 statements. [2025-03-04 16:20:31,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 16:20:31,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 432850 backedges. 296 proven. 17 refuted. 0 times theorem prover too weak. 432537 trivial. 0 not checked. [2025-03-04 16:20:31,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:20:31,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309431043] [2025-03-04 16:20:31,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309431043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 16:20:31,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992568423] [2025-03-04 16:20:31,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:20:31,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 16:20:31,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:20:31,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 16:20:31,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 16:20:32,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2645 statements into 93 equivalence classes. [2025-03-04 16:20:32,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 159 of 2645 statements. [2025-03-04 16:20:32,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 16:20:32,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:20:32,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 16:20:32,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 16:20:32,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 16:20:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 432850 backedges. 290 proven. 15 refuted. 0 times theorem prover too weak. 432545 trivial. 0 not checked. [2025-03-04 16:20:33,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 16:20:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 432850 backedges. 290 proven. 33 refuted. 0 times theorem prover too weak. 432527 trivial. 0 not checked. [2025-03-04 16:20:41,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992568423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 16:20:41,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 16:20:41,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 33 [2025-03-04 16:20:41,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537117143] [2025-03-04 16:20:41,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 16:20:41,878 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:20:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:20:41,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 16:20:41,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 16:20:41,879 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. cyclomatic complexity: 13 Second operand has 33 states, 25 states have (on average 2.36) internal successors, (59), 28 states have internal predecessors, (59), 15 states have call successors, (24), 7 states have call predecessors, (24), 11 states have return successors, (27), 14 states have call predecessors, (27), 15 states have call successors, (27) [2025-03-04 16:20:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:20:42,168 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-03-04 16:20:42,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 82 transitions. [2025-03-04 16:20:42,168 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:20:42,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 82 transitions. [2025-03-04 16:20:42,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2025-03-04 16:20:42,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-03-04 16:20:42,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 82 transitions. [2025-03-04 16:20:42,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:20:42,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 82 transitions. [2025-03-04 16:20:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 82 transitions. [2025-03-04 16:20:42,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 16:20:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 24 states have return successors, (28), 24 states have call predecessors, (28), 8 states have call successors, (28) [2025-03-04 16:20:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2025-03-04 16:20:42,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 82 transitions. [2025-03-04 16:20:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 16:20:42,181 INFO L432 stractBuchiCegarLoop]: Abstraction has 74 states and 82 transitions. [2025-03-04 16:20:42,181 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-04 16:20:42,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 82 transitions. [2025-03-04 16:20:42,182 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-03-04 16:20:42,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:20:42,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:20:42,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 16:20:42,193 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [700, 700, 600, 600, 600, 120, 120, 100, 100, 100, 100, 100, 100, 100, 24, 24, 20, 20, 20, 20, 20, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:20:42,193 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~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, 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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);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#5(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 write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);"< [2025-03-04 16:20:42,194 INFO L754 eck$LassoCheckResult]: Loop: "~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#65#return;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#67#return;" "assume true;" >"#63#return;" "call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#61#return;" "assume true;" >"#59#return;" "call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18;" "call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);"< [2025-03-04 16:20:42,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 14 times [2025-03-04 16:20:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:42,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464826224] [2025-03-04 16:20:42,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:20:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:42,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:42,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:42,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:20:42,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:42,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:20:42,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 16:20:42,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 16:20:42,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:20:42,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:20:42,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:20:42,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:20:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash 282634562, now seen corresponding path program 10 times [2025-03-04 16:20:42,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:20:42,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141746092] [2025-03-04 16:20:42,219 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:20:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:20:42,480 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4373 statements into 2 equivalence classes. [2025-03-04 16:20:44,406 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 4373 of 4373 statements. [2025-03-04 16:20:44,406 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 16:20:44,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat