./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:50:02,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:50:02,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:50:02,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:50:02,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:50:02,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:50:02,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:50:02,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:50:02,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:50:02,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:50:02,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:50:02,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:50:02,351 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:50:02,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:50:02,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:50:02,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:50:02,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:50:02,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:50:02,352 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:50:02,353 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2025-02-06 19:50:02,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:50:02,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:50:02,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:50:02,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:50:02,588 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:50:02,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-02-06 19:50:03,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad8cf4498/f4ae2a6bd8394417b45513e7e5037c80/FLAG6d72c45a0 [2025-02-06 19:50:04,009 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:50:04,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-02-06 19:50:04,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad8cf4498/f4ae2a6bd8394417b45513e7e5037c80/FLAG6d72c45a0 [2025-02-06 19:50:04,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad8cf4498/f4ae2a6bd8394417b45513e7e5037c80 [2025-02-06 19:50:04,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:50:04,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:50:04,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:50:04,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:50:04,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:50:04,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a38c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04, skipping insertion in model container [2025-02-06 19:50:04,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:50:04,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:50:04,445 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:50:04,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:50:04,479 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:50:04,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04 WrapperNode [2025-02-06 19:50:04,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:50:04,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:50:04,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:50:04,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:50:04,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,508 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-02-06 19:50:04,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:50:04,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:50:04,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:50:04,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:50:04,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,539 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-02-06 19:50:04,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:50:04,558 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:50:04,558 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:50:04,558 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:50:04,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (1/1) ... [2025-02-06 19:50:04,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:50:04,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:50:04,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:50:04,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:50:04,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:50:04,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 19:50:04,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 19:50:04,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 19:50:04,608 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-02-06 19:50:04,608 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-02-06 19:50:04,608 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-02-06 19:50:04,608 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-02-06 19:50:04,608 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-02-06 19:50:04,608 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-02-06 19:50:04,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:50:04,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:50:04,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:50:04,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:50:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 19:50:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 19:50:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 19:50:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 19:50:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2025-02-06 19:50:04,609 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2025-02-06 19:50:04,609 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-02-06 19:50:04,609 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-02-06 19:50:04,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:50:04,701 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:50:04,702 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:50:04,876 INFO L1309 $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-02-06 19:50:04,894 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-06 19:50:04,895 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:50:04,902 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:50:04,902 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:50:04,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:50:04 BoogieIcfgContainer [2025-02-06 19:50:04,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:50:04,903 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:50:04,903 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:50:04,907 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:50:04,907 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:50:04,907 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:50:04" (1/3) ... [2025-02-06 19:50:04,909 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e500365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:50:04, skipping insertion in model container [2025-02-06 19:50:04,910 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:50:04,910 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:50:04" (2/3) ... [2025-02-06 19:50:04,911 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e500365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:50:04, skipping insertion in model container [2025-02-06 19:50:04,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:50:04,911 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:50:04" (3/3) ... [2025-02-06 19:50:04,912 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2025-02-06 19:50:04,945 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:50:04,946 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:50:04,946 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:50:04,946 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:50:04,946 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:50:04,946 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:50:04,946 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:50:04,946 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:50:04,950 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-02-06 19:50:04,966 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:04,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:04,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:04,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:04,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:04,972 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:50:04,972 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-02-06 19:50:04,974 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:04,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:04,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:04,975 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:04,976 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:04,979 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:04,980 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:04,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 1 times [2025-02-06 19:50:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453672176] [2025-02-06 19:50:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:50:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:05,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:05,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:05,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:05,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:05,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:05,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:05,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:05,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:05,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:05,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:05,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1768289610, now seen corresponding path program 1 times [2025-02-06 19:50:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:05,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592429623] [2025-02-06 19:50:05,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:50:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:05,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:50:05,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:50:05,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:05,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:50:05,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:05,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592429623] [2025-02-06 19:50:05,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592429623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:50:05,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:50:05,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:50:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309209192] [2025-02-06 19:50:05,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:50:05,473 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:05,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:05,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:50:05,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:50:05,492 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-02-06 19:50:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:05,716 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-02-06 19:50:05,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2025-02-06 19:50:05,721 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:05,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 44 transitions. [2025-02-06 19:50:05,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-02-06 19:50:05,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-02-06 19:50:05,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2025-02-06 19:50:05,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:05,731 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-02-06 19:50:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2025-02-06 19:50:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 19:50:05,750 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-02-06 19:50:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-02-06 19:50:05,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-02-06 19:50:05,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:50:05,757 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-02-06 19:50:05,757 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:50:05,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2025-02-06 19:50:05,758 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:05,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:05,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:05,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:05,759 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:05,759 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:05,759 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:05,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 2 times [2025-02-06 19:50:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996401418] [2025-02-06 19:50:05,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:50:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:05,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:05,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:05,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:50:05,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:05,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:05,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:05,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:05,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:05,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:05,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:05,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash 413766199, now seen corresponding path program 1 times [2025-02-06 19:50:05,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:05,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379501265] [2025-02-06 19:50:05,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:50:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:05,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 19:50:05,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 19:50:05,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:05,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 19:50:05,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:05,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379501265] [2025-02-06 19:50:05,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379501265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:50:05,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:50:05,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:50:05,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318979367] [2025-02-06 19:50:05,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:50:05,975 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:05,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:50:05,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:50:05,976 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-02-06 19:50:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:06,113 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-02-06 19:50:06,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2025-02-06 19:50:06,115 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:06,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 46 transitions. [2025-02-06 19:50:06,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-02-06 19:50:06,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-02-06 19:50:06,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2025-02-06 19:50:06,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:06,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-02-06 19:50:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2025-02-06 19:50:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 19:50:06,122 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-02-06 19:50:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-02-06 19:50:06,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-02-06 19:50:06,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:50:06,124 INFO L432 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-02-06 19:50:06,124 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:50:06,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2025-02-06 19:50:06,125 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:06,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:06,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:06,127 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:06,127 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:06,127 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:06,127 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:06,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:06,127 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 3 times [2025-02-06 19:50:06,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:06,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849610089] [2025-02-06 19:50:06,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:50:06,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:06,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:06,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:06,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:50:06,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:06,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:06,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:06,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:06,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:06,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:06,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:06,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1401246586, now seen corresponding path program 1 times [2025-02-06 19:50:06,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710628850] [2025-02-06 19:50:06,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:50:06,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:06,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 19:50:06,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 19:50:06,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:06,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 19:50:06,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:06,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710628850] [2025-02-06 19:50:06,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710628850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:50:06,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:50:06,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:50:06,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751089083] [2025-02-06 19:50:06,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:50:06,335 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:06,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:06,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:50:06,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:50:06,336 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-02-06 19:50:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:06,442 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2025-02-06 19:50:06,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2025-02-06 19:50:06,443 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:06,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 48 transitions. [2025-02-06 19:50:06,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-02-06 19:50:06,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-02-06 19:50:06,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2025-02-06 19:50:06,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:06,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-02-06 19:50:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2025-02-06 19:50:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-06 19:50:06,450 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-02-06 19:50:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-02-06 19:50:06,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-02-06 19:50:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:50:06,451 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-02-06 19:50:06,451 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:50:06,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2025-02-06 19:50:06,452 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:06,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:06,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:06,453 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:06,453 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:06,453 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:06,453 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#69#return;" "call #t~mem8 := read~int#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:06,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:06,453 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 4 times [2025-02-06 19:50:06,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:06,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6956834] [2025-02-06 19:50:06,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:50:06,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:06,460 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-06 19:50:06,467 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:06,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:50:06,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:06,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:06,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:06,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:06,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:06,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:06,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:06,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash 197511696, now seen corresponding path program 1 times [2025-02-06 19:50:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224102644] [2025-02-06 19:50:06,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:50:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:06,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 19:50:06,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 19:50:06,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:06,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 19:50:06,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:06,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224102644] [2025-02-06 19:50:06,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224102644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:50:06,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:50:06,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 19:50:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551495548] [2025-02-06 19:50:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:50:06,717 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:06,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:06,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 19:50:06,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 19:50:06,718 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-02-06 19:50:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:06,788 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-02-06 19:50:06,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2025-02-06 19:50:06,790 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:06,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2025-02-06 19:50:06,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-02-06 19:50:06,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-02-06 19:50:06,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2025-02-06 19:50:06,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:06,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-02-06 19:50:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2025-02-06 19:50:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-06 19:50:06,793 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-02-06 19:50:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-02-06 19:50:06,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-02-06 19:50:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:50:06,794 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-02-06 19:50:06,795 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:50:06,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2025-02-06 19:50:06,795 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:06,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:06,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:06,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:06,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:06,796 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:06,797 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:06,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 5 times [2025-02-06 19:50:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574475119] [2025-02-06 19:50:06,797 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:50:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:06,803 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:06,808 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:06,808 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:50:06,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:06,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:06,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:06,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:06,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:06,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:06,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:06,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1731545009, now seen corresponding path program 1 times [2025-02-06 19:50:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:06,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55223788] [2025-02-06 19:50:06,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:50:06,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:06,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 19:50:06,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 19:50:06,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:06,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 19:50:07,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:07,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55223788] [2025-02-06 19:50:07,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55223788] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:50:07,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793643546] [2025-02-06 19:50:07,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:50:07,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:50:07,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:50:07,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:50:07,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 19:50:07,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 19:50:07,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 19:50:07,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:07,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:07,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 19:50:07,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:50:07,302 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-02-06 19:50:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 19:50:07,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:50:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 19:50:08,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793643546] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:50:08,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:50:08,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2025-02-06 19:50:08,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255216484] [2025-02-06 19:50:08,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:50:08,038 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:08,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:08,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 19:50:08,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-02-06 19:50:08,039 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-02-06 19:50:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:08,459 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-02-06 19:50:08,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2025-02-06 19:50:08,460 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:08,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2025-02-06 19:50:08,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-02-06 19:50:08,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-02-06 19:50:08,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2025-02-06 19:50:08,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:08,462 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-02-06 19:50:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2025-02-06 19:50:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 19:50:08,465 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-02-06 19:50:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-02-06 19:50:08,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-02-06 19:50:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 19:50:08,469 INFO L432 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-02-06 19:50:08,469 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:50:08,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2025-02-06 19:50:08,470 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:08,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:08,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:08,471 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:08,471 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-02-06 19:50:08,471 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:08,471 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:08,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:08,474 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 6 times [2025-02-06 19:50:08,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:08,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572467038] [2025-02-06 19:50:08,475 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:50:08,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:08,485 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:08,493 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:08,493 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:50:08,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:08,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:08,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:08,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:08,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:08,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:08,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:08,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:08,506 INFO L85 PathProgramCache]: Analyzing trace with hash 287260773, now seen corresponding path program 2 times [2025-02-06 19:50:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:08,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070532145] [2025-02-06 19:50:08,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:50:08,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:08,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-02-06 19:50:08,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 19:50:08,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:50:08,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 57 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 19:50:09,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070532145] [2025-02-06 19:50:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070532145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:50:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728674822] [2025-02-06 19:50:09,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:50:09,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:50:09,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:50:09,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:50:09,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 19:50:09,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-02-06 19:50:09,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 19:50:09,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:50:09,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:09,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-06 19:50:09,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:50:09,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 19:50:09,568 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 25 treesize of output 13 [2025-02-06 19:50:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 19:50:09,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:50:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-06 19:50:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728674822] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:50:10,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:50:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 29 [2025-02-06 19:50:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63367523] [2025-02-06 19:50:10,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:50:10,695 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:10,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:10,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 19:50:10,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-02-06 19:50:10,702 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 29 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 25 states have internal predecessors, (65), 10 states have call successors, (25), 6 states have call predecessors, (25), 9 states have return successors, (26), 7 states have call predecessors, (26), 10 states have call successors, (26) [2025-02-06 19:50:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:11,041 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-02-06 19:50:11,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2025-02-06 19:50:11,042 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:11,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2025-02-06 19:50:11,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-02-06 19:50:11,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-02-06 19:50:11,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2025-02-06 19:50:11,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:11,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-06 19:50:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2025-02-06 19:50:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 19:50:11,053 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-02-06 19:50:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-02-06 19:50:11,054 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-06 19:50:11,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:50:11,055 INFO L432 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-06 19:50:11,055 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:50:11,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2025-02-06 19:50:11,055 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:11,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:11,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:11,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:11,057 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-02-06 19:50:11,057 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:11,057 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:11,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 7 times [2025-02-06 19:50:11,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:11,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176398117] [2025-02-06 19:50:11,058 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:50:11,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:11,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:11,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:11,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:11,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:11,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:11,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:11,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:11,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:11,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:11,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:11,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2109703393, now seen corresponding path program 3 times [2025-02-06 19:50:11,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:11,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447826771] [2025-02-06 19:50:11,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:50:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:11,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 9 equivalence classes. [2025-02-06 19:50:11,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 104 statements. [2025-02-06 19:50:11,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 19:50:11,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2025-02-06 19:50:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447826771] [2025-02-06 19:50:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447826771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:50:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411699083] [2025-02-06 19:50:11,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:50:11,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:50:11,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:50:11,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:50:11,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 19:50:11,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 9 equivalence classes. [2025-02-06 19:50:11,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 104 statements. [2025-02-06 19:50:11,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 19:50:11,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:11,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 19:50:11,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:50:11,394 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-02-06 19:50:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2025-02-06 19:50:11,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:50:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-06 19:50:11,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411699083] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:50:11,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:50:11,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 22 [2025-02-06 19:50:11,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817533816] [2025-02-06 19:50:11,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:50:11,904 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:11,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:11,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 19:50:11,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-02-06 19:50:11,904 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 22 states, 17 states have (on average 2.235294117647059) internal successors, (38), 19 states have internal predecessors, (38), 10 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (14), 8 states have call predecessors, (14), 9 states have call successors, (14) [2025-02-06 19:50:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:12,170 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2025-02-06 19:50:12,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2025-02-06 19:50:12,171 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:12,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 62 transitions. [2025-02-06 19:50:12,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-02-06 19:50:12,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-02-06 19:50:12,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2025-02-06 19:50:12,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:12,173 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-02-06 19:50:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2025-02-06 19:50:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-06 19:50:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 34 states have internal predecessors, (34), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (18), 14 states have call predecessors, (18), 8 states have call successors, (18) [2025-02-06 19:50:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2025-02-06 19:50:12,175 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-02-06 19:50:12,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 19:50:12,177 INFO L432 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-02-06 19:50:12,177 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-06 19:50:12,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2025-02-06 19:50:12,178 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:12,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:12,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:12,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:12,184 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 24, 24, 24, 12, 12, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:12,184 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:12,184 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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;" >"#73#return;" "call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:12,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:12,186 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 8 times [2025-02-06 19:50:12,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:12,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702841320] [2025-02-06 19:50:12,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:50:12,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:12,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:12,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:12,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:50:12,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:12,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:12,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:12,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:12,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:12,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:12,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:12,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:12,204 INFO L85 PathProgramCache]: Analyzing trace with hash 225384071, now seen corresponding path program 4 times [2025-02-06 19:50:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201219264] [2025-02-06 19:50:12,204 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:50:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:12,233 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 294 statements into 2 equivalence classes. [2025-02-06 19:50:12,245 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-06 19:50:12,247 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:50:12,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2547 backedges. 32 proven. 119 refuted. 0 times theorem prover too weak. 2396 trivial. 0 not checked. [2025-02-06 19:50:13,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:13,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201219264] [2025-02-06 19:50:13,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201219264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:50:13,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449178061] [2025-02-06 19:50:13,030 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:50:13,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:50:13,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:50:13,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:50:13,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 19:50:13,149 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 294 statements into 2 equivalence classes. [2025-02-06 19:50:13,316 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-06 19:50:13,317 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 19:50:13,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:13,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-06 19:50:13,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:50:13,366 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-02-06 19:50:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2547 backedges. 1237 proven. 12 refuted. 0 times theorem prover too weak. 1298 trivial. 0 not checked. [2025-02-06 19:50:13,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:50:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2547 backedges. 59 proven. 66 refuted. 0 times theorem prover too weak. 2422 trivial. 0 not checked. [2025-02-06 19:50:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449178061] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:50:14,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:50:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 14] total 31 [2025-02-06 19:50:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904215302] [2025-02-06 19:50:14,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:50:14,888 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:14,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:14,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 19:50:14,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2025-02-06 19:50:14,889 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 13 Second operand has 31 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 26 states have internal predecessors, (76), 15 states have call successors, (33), 7 states have call predecessors, (33), 10 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2025-02-06 19:50:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:15,372 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2025-02-06 19:50:15,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2025-02-06 19:50:15,373 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:15,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2025-02-06 19:50:15,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-02-06 19:50:15,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-02-06 19:50:15,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2025-02-06 19:50:15,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:15,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-02-06 19:50:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2025-02-06 19:50:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-06 19:50:15,376 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-02-06 19:50:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-02-06 19:50:15,377 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-02-06 19:50:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 19:50:15,379 INFO L432 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-02-06 19:50:15,379 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-02-06 19:50:15,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2025-02-06 19:50:15,380 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:15,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:15,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:15,384 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:15,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [90, 90, 72, 72, 72, 27, 27, 18, 18, 18, 18, 18, 18, 18, 12, 12, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:15,385 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:15,385 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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;" >"#73#return;" "call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:15,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 9 times [2025-02-06 19:50:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:15,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945598786] [2025-02-06 19:50:15,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:50:15,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:15,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:15,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:15,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:50:15,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:15,400 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:15,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:15,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:15,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:15,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:15,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:15,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash 270641662, now seen corresponding path program 5 times [2025-02-06 19:50:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:15,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475546188] [2025-02-06 19:50:15,409 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:50:15,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:15,460 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 699 statements into 13 equivalence classes. [2025-02-06 19:50:15,513 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 231 of 699 statements. [2025-02-06 19:50:15,513 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 19:50:15,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20844 backedges. 23 proven. 2135 refuted. 0 times theorem prover too weak. 18686 trivial. 0 not checked. [2025-02-06 19:50:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475546188] [2025-02-06 19:50:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475546188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:50:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036350843] [2025-02-06 19:50:16,806 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:50:16,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:50:16,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:50:16,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:50:16,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 19:50:17,025 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 699 statements into 13 equivalence classes. [2025-02-06 19:50:18,278 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 231 of 699 statements. [2025-02-06 19:50:18,278 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 19:50:18,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:18,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-06 19:50:18,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:50:18,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 19:50:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 20844 backedges. 2079 proven. 24 refuted. 0 times theorem prover too weak. 18741 trivial. 0 not checked. [2025-02-06 19:50:18,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:50:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20844 backedges. 16 proven. 2153 refuted. 0 times theorem prover too weak. 18675 trivial. 0 not checked. [2025-02-06 19:50:21,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036350843] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:50:21,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:50:21,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 22] total 42 [2025-02-06 19:50:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174102444] [2025-02-06 19:50:21,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:50:21,509 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:21,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 19:50:21,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1407, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 19:50:21,510 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 42 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 36 states have internal predecessors, (79), 13 states have call successors, (30), 8 states have call predecessors, (30), 14 states have return successors, (35), 12 states have call predecessors, (35), 13 states have call successors, (35) [2025-02-06 19:50:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:22,070 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2025-02-06 19:50:22,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 83 transitions. [2025-02-06 19:50:22,071 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:22,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 67 states and 77 transitions. [2025-02-06 19:50:22,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-02-06 19:50:22,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-02-06 19:50:22,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 77 transitions. [2025-02-06 19:50:22,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:22,073 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-02-06 19:50:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 77 transitions. [2025-02-06 19:50:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-02-06 19:50:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 40 states have internal predecessors, (41), 11 states have call successors, (11), 6 states have call predecessors, (11), 18 states have return successors, (22), 18 states have call predecessors, (22), 9 states have call successors, (22) [2025-02-06 19:50:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-02-06 19:50:22,081 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-02-06 19:50:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 19:50:22,082 INFO L432 stractBuchiCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-02-06 19:50:22,083 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-02-06 19:50:22,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 74 transitions. [2025-02-06 19:50:22,084 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:22,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:22,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:22,088 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:22,090 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [126, 126, 108, 108, 108, 27, 27, 18, 18, 18, 18, 18, 18, 18, 12, 12, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:22,091 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:22,092 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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;" >"#73#return;" "call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:22,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 10 times [2025-02-06 19:50:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:22,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066463831] [2025-02-06 19:50:22,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:50:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:22,099 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3 statements into 2 equivalence classes. [2025-02-06 19:50:22,104 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:22,104 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:50:22,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:22,104 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:22,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:22,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:22,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:22,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:22,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:22,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash 73902526, now seen corresponding path program 6 times [2025-02-06 19:50:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:22,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408319136] [2025-02-06 19:50:22,113 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:50:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:22,195 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 879 statements into 15 equivalence classes. [2025-02-06 19:50:22,278 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 156 of 879 statements. [2025-02-06 19:50:22,279 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-06 19:50:22,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 39546 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 39522 trivial. 0 not checked. [2025-02-06 19:50:23,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408319136] [2025-02-06 19:50:23,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408319136] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:50:23,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387599719] [2025-02-06 19:50:23,028 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:50:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:50:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:50:23,030 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:50:23,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 19:50:23,290 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 879 statements into 15 equivalence classes. [2025-02-06 19:50:23,938 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 156 of 879 statements. [2025-02-06 19:50:23,938 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-06 19:50:23,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:23,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 19:50:23,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:50:23,965 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-02-06 19:50:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 39546 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 39531 trivial. 0 not checked. [2025-02-06 19:50:24,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:50:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 39546 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 39513 trivial. 0 not checked. [2025-02-06 19:50:26,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387599719] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:50:26,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:50:26,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 34 [2025-02-06 19:50:26,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750721295] [2025-02-06 19:50:26,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:50:26,888 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:26,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:26,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 19:50:26,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 19:50:26,890 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. cyclomatic complexity: 14 Second operand has 34 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 29 states have internal predecessors, (51), 15 states have call successors, (19), 7 states have call predecessors, (19), 10 states have return successors, (22), 14 states have call predecessors, (22), 14 states have call successors, (22) [2025-02-06 19:50:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:27,271 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2025-02-06 19:50:27,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 78 transitions. [2025-02-06 19:50:27,272 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:27,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 78 transitions. [2025-02-06 19:50:27,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-02-06 19:50:27,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-02-06 19:50:27,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2025-02-06 19:50:27,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:27,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-02-06 19:50:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2025-02-06 19:50:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-06 19:50:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.131578947368421) internal successors, (43), 42 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 20 states have return successors, (24), 20 states have call predecessors, (24), 9 states have call successors, (24) [2025-02-06 19:50:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-02-06 19:50:27,278 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-02-06 19:50:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:50:27,283 INFO L432 stractBuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-02-06 19:50:27,283 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-02-06 19:50:27,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 78 transitions. [2025-02-06 19:50:27,283 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:27,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:27,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:27,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:27,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [210, 210, 180, 180, 180, 45, 45, 30, 30, 30, 30, 30, 30, 30, 20, 20, 15, 15, 15, 15, 15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:27,293 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:27,294 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:27,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:27,295 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 11 times [2025-02-06 19:50:27,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:27,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055557040] [2025-02-06 19:50:27,295 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:50:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:27,300 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:27,304 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:27,304 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:50:27,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:27,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:27,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:27,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:27,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:27,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:27,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:27,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1268937262, now seen corresponding path program 7 times [2025-02-06 19:50:27,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:27,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967666268] [2025-02-06 19:50:27,311 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:50:27,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:27,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1459 statements into 1 equivalence classes. [2025-02-06 19:50:27,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1459 of 1459 statements. [2025-02-06 19:50:27,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:27,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 110320 backedges. 73 proven. 743 refuted. 0 times theorem prover too weak. 109504 trivial. 0 not checked. [2025-02-06 19:50:33,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:50:33,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967666268] [2025-02-06 19:50:33,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967666268] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:50:33,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433295890] [2025-02-06 19:50:33,782 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:50:33,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:50:33,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:50:33,788 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:50:33,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 19:50:34,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1459 statements into 1 equivalence classes. [2025-02-06 19:50:34,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1459 of 1459 statements. [2025-02-06 19:50:34,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:34,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:50:34,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 8684 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 19:50:34,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:50:34,932 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-02-06 19:50:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 110320 backedges. 53372 proven. 15 refuted. 0 times theorem prover too weak. 56933 trivial. 0 not checked. [2025-02-06 19:50:35,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:50:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 110320 backedges. 110 proven. 315 refuted. 0 times theorem prover too weak. 109895 trivial. 0 not checked. [2025-02-06 19:50:41,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433295890] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:50:41,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:50:41,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 18] total 37 [2025-02-06 19:50:41,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763077251] [2025-02-06 19:50:41,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:50:41,086 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:50:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:50:41,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 19:50:41,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 19:50:41,089 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. cyclomatic complexity: 14 Second operand has 37 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 31 states have internal predecessors, (79), 17 states have call successors, (33), 8 states have call predecessors, (33), 13 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2025-02-06 19:50:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:50:42,312 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2025-02-06 19:50:42,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 82 transitions. [2025-02-06 19:50:42,314 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:42,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 82 transitions. [2025-02-06 19:50:42,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2025-02-06 19:50:42,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-02-06 19:50:42,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 82 transitions. [2025-02-06 19:50:42,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:50:42,316 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 82 transitions. [2025-02-06 19:50:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 82 transitions. [2025-02-06 19:50:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-06 19:50:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 40 states have (on average 1.125) internal successors, (45), 44 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 22 states have return successors, (26), 22 states have call predecessors, (26), 9 states have call successors, (26) [2025-02-06 19:50:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2025-02-06 19:50:42,320 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 82 transitions. [2025-02-06 19:50:42,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 19:50:42,332 INFO L432 stractBuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2025-02-06 19:50:42,332 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-02-06 19:50:42,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 82 transitions. [2025-02-06 19:50:42,333 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:50:42,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:50:42,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:50:42,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:50:42,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [420, 420, 360, 360, 360, 80, 80, 60, 60, 60, 60, 60, 60, 60, 25, 25, 20, 20, 20, 20, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:50:42,338 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:50:42,339 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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;" >"#59#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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;" >"#59#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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;" >"#59#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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;" >"#59#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#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;" >"#59#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:50:42,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 12 times [2025-02-06 19:50:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:42,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868475901] [2025-02-06 19:50:42,341 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 19:50:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:42,377 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:42,381 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:42,381 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 19:50:42,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:42,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:50:42,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:50:42,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:50:42,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:50:42,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:50:42,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:50:42,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:50:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash -819504609, now seen corresponding path program 8 times [2025-02-06 19:50:42,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:50:42,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323593407] [2025-02-06 19:50:42,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:50:42,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:50:42,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2744 statements into 2 equivalence classes. [2025-02-06 19:50:43,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2744 of 2744 statements. [2025-02-06 19:50:43,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:50:43,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:51:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 436390 backedges. 308 proven. 1687 refuted. 0 times theorem prover too weak. 434395 trivial. 0 not checked. [2025-02-06 19:51:05,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:51:05,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323593407] [2025-02-06 19:51:05,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323593407] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:51:05,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423702524] [2025-02-06 19:51:05,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:51:05,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:51:05,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:51:05,419 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:51:05,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 19:51:06,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2744 statements into 2 equivalence classes. [2025-02-06 19:51:07,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2744 of 2744 statements. [2025-02-06 19:51:07,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:51:07,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:51:07,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 15884 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-02-06 19:51:07,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:51:07,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 19:51:08,006 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 25 treesize of output 13 [2025-02-06 19:51:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 436390 backedges. 165657 proven. 15 refuted. 0 times theorem prover too weak. 270718 trivial. 0 not checked. [2025-02-06 19:51:08,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:51:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 436390 backedges. 1440 proven. 535 refuted. 0 times theorem prover too weak. 434415 trivial. 0 not checked. [2025-02-06 19:51:18,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423702524] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:51:18,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:51:18,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 18] total 34 [2025-02-06 19:51:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2471647] [2025-02-06 19:51:18,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:51:18,322 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:51:18,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:51:18,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 19:51:18,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 19:51:18,323 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. cyclomatic complexity: 14 Second operand has 34 states, 25 states have (on average 3.12) internal successors, (78), 29 states have internal predecessors, (78), 17 states have call successors, (34), 7 states have call predecessors, (34), 11 states have return successors, (39), 15 states have call predecessors, (39), 17 states have call successors, (39) [2025-02-06 19:51:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:51:18,614 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2025-02-06 19:51:18,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 86 transitions. [2025-02-06 19:51:18,615 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:51:18,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 86 transitions. [2025-02-06 19:51:18,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2025-02-06 19:51:18,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-02-06 19:51:18,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 86 transitions. [2025-02-06 19:51:18,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:51:18,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 86 transitions. [2025-02-06 19:51:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 86 transitions. [2025-02-06 19:51:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 19:51:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 42 states have (on average 1.119047619047619) internal successors, (47), 46 states have internal predecessors, (47), 11 states have call successors, (11), 6 states have call predecessors, (11), 24 states have return successors, (28), 24 states have call predecessors, (28), 9 states have call successors, (28) [2025-02-06 19:51:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2025-02-06 19:51:18,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 86 transitions. [2025-02-06 19:51:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 19:51:18,621 INFO L432 stractBuchiCegarLoop]: Abstraction has 77 states and 86 transitions. [2025-02-06 19:51:18,621 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-02-06 19:51:18,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 86 transitions. [2025-02-06 19:51:18,623 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2025-02-06 19:51:18,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:51:18,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:51:18,633 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:51:18,633 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [700, 700, 600, 600, 600, 120, 120, 100, 100, 100, 100, 100, 100, 100, 25, 25, 20, 20, 20, 20, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:51:18,634 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#5(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#4(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#3(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#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(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-02-06 19:51:18,635 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#5(~a.base, ~a.offset, 4);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#59#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#59#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#59#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#59#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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#3(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#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4);" "assume !(#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#3(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~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;" >"#59#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(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#4(~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;" >"#57#return;" "assume true;" >"#73#return;" "call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(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-02-06 19:51:18,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:51:18,637 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 13 times [2025-02-06 19:51:18,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:51:18,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19279375] [2025-02-06 19:51:18,638 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 19:51:18,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:51:18,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:51:18,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:51:18,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:51:18,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:51:18,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:51:18,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:51:18,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:51:18,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:51:18,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:51:18,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:51:18,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:51:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2047865071, now seen corresponding path program 9 times [2025-02-06 19:51:18,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:51:18,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093575938] [2025-02-06 19:51:18,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:51:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:51:18,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4384 statements into 233 equivalence classes. [2025-02-06 19:51:25,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) and asserted 1786 of 4384 statements. [2025-02-06 19:51:25,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2025-02-06 19:51:25,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat