./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 02:53:05,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 02:53:05,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-23 02:53:05,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 02:53:05,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 02:53:05,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 02:53:05,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 02:53:05,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 02:53:05,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 02:53:05,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 02:53:05,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 02:53:05,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 02:53:05,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 02:53:05,907 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-23 02:53:05,907 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-23 02:53:05,910 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-23 02:53:05,910 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-23 02:53:05,911 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-23 02:53:05,911 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-23 02:53:05,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 02:53:05,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-23 02:53:05,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 02:53:05,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 02:53:05,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 02:53:05,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 02:53:05,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-23 02:53:05,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-23 02:53:05,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-23 02:53:05,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 02:53:05,913 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 02:53:05,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 02:53:05,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 02:53:05,913 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-23 02:53:05,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 02:53:05,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 02:53:05,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 02:53:05,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 02:53:05,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 02:53:05,915 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-23 02:53:05,915 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2024-11-23 02:53:06,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 02:53:06,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 02:53:06,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 02:53:06,159 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 02:53:06,159 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 02:53:06,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-23 02:53:07,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 02:53:07,835 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 02:53:07,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-23 02:53:07,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1872a9587/b0dbb332221542b994ade77f425cb655/FLAGe6e4e9442 [2024-11-23 02:53:07,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1872a9587/b0dbb332221542b994ade77f425cb655 [2024-11-23 02:53:07,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 02:53:07,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 02:53:07,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 02:53:07,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 02:53:07,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 02:53:07,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:07" (1/1) ... [2024-11-23 02:53:07,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff4df57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:07, skipping insertion in model container [2024-11-23 02:53:07,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:53:07" (1/1) ... [2024-11-23 02:53:07,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 02:53:08,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:53:08,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 02:53:08,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 02:53:08,172 INFO L204 MainTranslator]: Completed translation [2024-11-23 02:53:08,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08 WrapperNode [2024-11-23 02:53:08,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 02:53:08,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 02:53:08,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 02:53:08,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 02:53:08,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,204 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-23 02:53:08,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 02:53:08,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 02:53:08,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 02:53:08,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 02:53:08,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,249 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]. [2024-11-23 02:53:08,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 02:53:08,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 02:53:08,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 02:53:08,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 02:53:08,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (1/1) ... [2024-11-23 02:53:08,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-23 02:53:08,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:53:08,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-23 02:53:08,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-23 02:53:08,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 02:53:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 02:53:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 02:53:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-23 02:53:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-23 02:53:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-23 02:53:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-23 02:53:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 02:53:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 02:53:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 02:53:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 02:53:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-23 02:53:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-23 02:53:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-23 02:53:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-23 02:53:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-23 02:53:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-23 02:53:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-23 02:53:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-23 02:53:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-23 02:53:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 02:53:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 02:53:08,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 02:53:08,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 02:53:08,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-23 02:53:08,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-23 02:53:08,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-23 02:53:08,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-23 02:53:08,352 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-11-23 02:53:08,352 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-11-23 02:53:08,352 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-23 02:53:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-23 02:53:08,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 02:53:08,495 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 02:53:08,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 02:53:08,919 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-23 02:53:08,919 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 02:53:08,947 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 02:53:08,948 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 02:53:08,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:08 BoogieIcfgContainer [2024-11-23 02:53:08,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 02:53:08,949 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-23 02:53:08,949 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-23 02:53:08,952 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-23 02:53:08,953 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:53:08,953 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:53:07" (1/3) ... [2024-11-23 02:53:08,957 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@174e0c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:53:08, skipping insertion in model container [2024-11-23 02:53:08,957 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:53:08,957 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:53:08" (2/3) ... [2024-11-23 02:53:08,958 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@174e0c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:53:08, skipping insertion in model container [2024-11-23 02:53:08,958 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-23 02:53:08,958 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:53:08" (3/3) ... [2024-11-23 02:53:08,960 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2024-11-23 02:53:09,055 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-23 02:53:09,056 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-23 02:53:09,056 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-23 02:53:09,056 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-23 02:53:09,056 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-23 02:53:09,056 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-23 02:53:09,056 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-23 02:53:09,056 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-23 02:53:09,061 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) [2024-11-23 02:53:09,082 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:09,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:09,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:09,092 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:09,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:09,092 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-23 02:53:09,093 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) [2024-11-23 02:53:09,099 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:09,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:09,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:09,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:09,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:09,109 INFO L745 eck$LassoCheckResult]: Stem: 19#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 26#L-1true 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#1(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#4(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); 39#L128true 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);< 29#$Ultimate##0true [2024-11-23 02:53:09,109 INFO L747 eck$LassoCheckResult]: Loop: 29#$Ultimate##0true ~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); 5#L101true assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 6#L107true 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);< 42#$Ultimate##0true ~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#1(~b.base, ~b.offset, 4); 25#L81true assume !(#t~mem13 < 6);havoc #t~mem13; 21#L81-1true assume true; 20#func_to_recursive_line_24_to_25_0EXITtrue >#112#return; 3#L107-1true 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; 34#L112true 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);< 29#$Ultimate##0true [2024-11-23 02:53:09,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:09,114 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 1 times [2024-11-23 02:53:09,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225707774] [2024-11-23 02:53:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:09,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:09,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:09,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2053320187, now seen corresponding path program 1 times [2024-11-23 02:53:09,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978100899] [2024-11-23 02:53:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 02:53:09,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:09,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978100899] [2024-11-23 02:53:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978100899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:09,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:09,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 02:53:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597698722] [2024-11-23 02:53:09,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:09,701 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:09,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:53:09,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:53:09,766 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) [2024-11-23 02:53:10,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:10,015 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-23 02:53:10,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2024-11-23 02:53:10,021 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:10,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 44 transitions. [2024-11-23 02:53:10,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-23 02:53:10,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-23 02:53:10,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2024-11-23 02:53:10,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:10,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-23 02:53:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2024-11-23 02:53:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-23 02:53:10,052 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) [2024-11-23 02:53:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-23 02:53:10,053 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-23 02:53:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:53:10,058 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-23 02:53:10,058 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-23 02:53:10,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2024-11-23 02:53:10,059 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:10,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:10,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:10,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:10,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:10,061 INFO L745 eck$LassoCheckResult]: Stem: 151#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 133#L-1 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#1(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#4(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); 122#L128 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);< 146#$Ultimate##0 [2024-11-23 02:53:10,061 INFO L747 eck$LassoCheckResult]: Loop: 146#$Ultimate##0 ~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); 131#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 127#L107 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);< 132#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 126#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 129#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 147#$Ultimate##0 ~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); 148#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 136#L61-1 assume true; 134#func_to_recursive_line_25_to_26_0EXIT >#98#return; 137#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 128#L92 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);< 132#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 126#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 130#L81-1 assume true; 149#func_to_recursive_line_24_to_25_0EXIT >#100#return; 150#L81-1 assume true; 152#func_to_recursive_line_24_to_25_0EXIT >#112#return; 121#L107-1 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; 123#L112 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);< 146#$Ultimate##0 [2024-11-23 02:53:10,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 2 times [2024-11-23 02:53:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767734980] [2024-11-23 02:53:10,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:53:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:10,077 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:53:10,078 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:10,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:10,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:10,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash 54735792, now seen corresponding path program 1 times [2024-11-23 02:53:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:10,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776438600] [2024-11-23 02:53:10,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 02:53:10,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:10,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776438600] [2024-11-23 02:53:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776438600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:10,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 02:53:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124064390] [2024-11-23 02:53:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:10,250 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:10,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:53:10,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:53:10,251 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) [2024-11-23 02:53:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:10,352 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-23 02:53:10,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. [2024-11-23 02:53:10,353 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:10,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 46 transitions. [2024-11-23 02:53:10,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-11-23 02:53:10,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-23 02:53:10,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2024-11-23 02:53:10,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:10,355 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-23 02:53:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2024-11-23 02:53:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-23 02:53:10,358 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) [2024-11-23 02:53:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-23 02:53:10,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-23 02:53:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:53:10,359 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-23 02:53:10,359 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-23 02:53:10,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2024-11-23 02:53:10,360 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:10,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:10,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:10,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:10,361 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] [2024-11-23 02:53:10,361 INFO L745 eck$LassoCheckResult]: Stem: 237#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 218#L-1 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#1(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#4(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); 203#L128 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);< 230#$Ultimate##0 [2024-11-23 02:53:10,361 INFO L747 eck$LassoCheckResult]: Loop: 230#$Ultimate##0 ~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); 216#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 213#L107 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);< 217#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 211#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 214#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 231#$Ultimate##0 ~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); 234#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 225#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 223#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 226#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 228#L41-1 assume true; 227#func_to_recursive_line_26_to_27_0EXIT >#102#return; 229#L67-1 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; 220#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 231#$Ultimate##0 ~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); 234#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 233#L61-1 assume true; 219#func_to_recursive_line_25_to_26_0EXIT >#104#return; 221#L61-1 assume true; 239#func_to_recursive_line_25_to_26_0EXIT >#98#return; 232#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 212#L92 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);< 217#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 211#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 215#L81-1 assume true; 235#func_to_recursive_line_24_to_25_0EXIT >#100#return; 236#L81-1 assume true; 238#func_to_recursive_line_24_to_25_0EXIT >#112#return; 202#L107-1 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; 204#L112 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);< 230#$Ultimate##0 [2024-11-23 02:53:10,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 3 times [2024-11-23 02:53:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690096465] [2024-11-23 02:53:10,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:53:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:10,376 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:53:10,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:10,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:10,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:10,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:10,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1525796123, now seen corresponding path program 1 times [2024-11-23 02:53:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191610086] [2024-11-23 02:53:10,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:10,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 02:53:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:10,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191610086] [2024-11-23 02:53:10,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191610086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:10,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:10,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 02:53:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192494072] [2024-11-23 02:53:10,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:10,678 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:10,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:10,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:53:10,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:53:10,681 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) [2024-11-23 02:53:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:10,804 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-23 02:53:10,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2024-11-23 02:53:10,806 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:10,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 48 transitions. [2024-11-23 02:53:10,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-23 02:53:10,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-23 02:53:10,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2024-11-23 02:53:10,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:10,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-23 02:53:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2024-11-23 02:53:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-23 02:53:10,812 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) [2024-11-23 02:53:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-23 02:53:10,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-23 02:53:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:53:10,814 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-23 02:53:10,814 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-23 02:53:10,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2024-11-23 02:53:10,815 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:10,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:10,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:10,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:10,817 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] [2024-11-23 02:53:10,817 INFO L745 eck$LassoCheckResult]: Stem: 327#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 307#L-1 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#1(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#4(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); 297#L128 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);< 319#$Ultimate##0 [2024-11-23 02:53:10,817 INFO L747 eck$LassoCheckResult]: Loop: 319#$Ultimate##0 ~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); 305#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 301#L107 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);< 306#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 300#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 303#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 320#$Ultimate##0 ~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); 324#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 314#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 312#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 315#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 292#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 298#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 299#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 291#L25-1 assume true; 294#func_to_recursive_line_27_to_27_0EXIT >#108#return; 311#L47-1 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; 313#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 312#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 315#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 318#L41-1 assume true; 316#func_to_recursive_line_26_to_27_0EXIT >#110#return; 317#L41-1 assume true; 330#func_to_recursive_line_26_to_27_0EXIT >#102#return; 322#L67-1 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; 309#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 320#$Ultimate##0 ~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); 324#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 323#L61-1 assume true; 308#func_to_recursive_line_25_to_26_0EXIT >#104#return; 310#L61-1 assume true; 329#func_to_recursive_line_25_to_26_0EXIT >#98#return; 321#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 302#L92 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);< 306#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 300#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 304#L81-1 assume true; 325#func_to_recursive_line_24_to_25_0EXIT >#100#return; 326#L81-1 assume true; 328#func_to_recursive_line_24_to_25_0EXIT >#112#return; 295#L107-1 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; 296#L112 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);< 319#$Ultimate##0 [2024-11-23 02:53:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 4 times [2024-11-23 02:53:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:10,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167586161] [2024-11-23 02:53:10,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:53:10,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:10,849 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:53:10,849 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:10,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:10,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:10,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1439872263, now seen corresponding path program 1 times [2024-11-23 02:53:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957375629] [2024-11-23 02:53:10,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-23 02:53:11,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:11,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957375629] [2024-11-23 02:53:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957375629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 02:53:11,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 02:53:11,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 02:53:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825976407] [2024-11-23 02:53:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 02:53:11,218 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:11,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 02:53:11,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 02:53:11,219 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) [2024-11-23 02:53:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:11,299 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-23 02:53:11,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2024-11-23 02:53:11,300 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:11,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2024-11-23 02:53:11,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-23 02:53:11,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-23 02:53:11,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2024-11-23 02:53:11,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:11,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-23 02:53:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2024-11-23 02:53:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-23 02:53:11,305 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) [2024-11-23 02:53:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-23 02:53:11,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-23 02:53:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 02:53:11,306 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-23 02:53:11,306 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-23 02:53:11,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2024-11-23 02:53:11,307 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:11,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:11,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:11,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:11,308 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] [2024-11-23 02:53:11,308 INFO L745 eck$LassoCheckResult]: Stem: 419#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 400#L-1 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#1(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#4(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); 389#L128 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);< 411#$Ultimate##0 [2024-11-23 02:53:11,309 INFO L747 eck$LassoCheckResult]: Loop: 411#$Ultimate##0 ~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); 398#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 394#L107 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);< 399#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 393#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 396#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~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); 417#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 406#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 405#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 408#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 386#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 391#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 392#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 385#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 391#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 392#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 384#L25-1 assume true; 387#func_to_recursive_line_27_to_27_0EXIT >#106#return; 404#L25-1 assume true; 424#func_to_recursive_line_27_to_27_0EXIT >#108#return; 422#L47-1 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; 407#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 405#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 408#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 412#L41-1 assume true; 409#func_to_recursive_line_26_to_27_0EXIT >#110#return; 410#L41-1 assume true; 425#func_to_recursive_line_26_to_27_0EXIT >#102#return; 415#L67-1 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; 402#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~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); 417#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 418#L61-1 assume true; 401#func_to_recursive_line_25_to_26_0EXIT >#104#return; 403#L61-1 assume true; 416#func_to_recursive_line_25_to_26_0EXIT >#98#return; 414#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 395#L92 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);< 399#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 393#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 397#L81-1 assume true; 420#func_to_recursive_line_24_to_25_0EXIT >#100#return; 421#L81-1 assume true; 423#func_to_recursive_line_24_to_25_0EXIT >#112#return; 388#L107-1 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; 390#L112 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);< 411#$Ultimate##0 [2024-11-23 02:53:11,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 5 times [2024-11-23 02:53:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:11,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953442666] [2024-11-23 02:53:11,310 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:53:11,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:11,320 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:53:11,321 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:11,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:11,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:11,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash 405682375, now seen corresponding path program 1 times [2024-11-23 02:53:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:11,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364566215] [2024-11-23 02:53:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:11,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-23 02:53:11,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:11,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364566215] [2024-11-23 02:53:11,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364566215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:53:11,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242351375] [2024-11-23 02:53:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 02:53:11,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:53:11,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:53:11,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:53:11,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 02:53:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:11,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-23 02:53:11,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:53:11,892 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 [2024-11-23 02:53:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 02:53:12,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:53:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-23 02:53:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242351375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:53:12,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:53:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 26 [2024-11-23 02:53:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119321300] [2024-11-23 02:53:12,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:53:12,675 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:12,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:12,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-23 02:53:12,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-11-23 02:53:12,677 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 26 states, 20 states have (on average 2.7) internal successors, (54), 22 states have internal predecessors, (54), 11 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-23 02:53:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:13,319 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-23 02:53:13,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-23 02:53:13,323 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:13,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2024-11-23 02:53:13,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-23 02:53:13,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-23 02:53:13,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2024-11-23 02:53:13,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:13,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-23 02:53:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2024-11-23 02:53:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-23 02:53:13,333 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) [2024-11-23 02:53:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-23 02:53:13,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-23 02:53:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-23 02:53:13,337 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-23 02:53:13,337 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-23 02:53:13,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-23 02:53:13,337 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:13,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:13,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:13,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:13,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:13,341 INFO L745 eck$LassoCheckResult]: Stem: 837#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 819#L-1 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#1(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#4(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); 808#L128 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);< 830#$Ultimate##0 [2024-11-23 02:53:13,342 INFO L747 eck$LassoCheckResult]: Loop: 830#$Ultimate##0 ~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); 817#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 814#L107 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);< 818#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 812#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 815#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 832#$Ultimate##0 ~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); 836#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 826#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 824#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 827#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 805#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 810#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 811#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 804#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 810#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 811#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 804#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 810#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 811#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 803#L25-1 assume true; 806#func_to_recursive_line_27_to_27_0EXIT >#106#return; 820#L25-1 assume true; 847#func_to_recursive_line_27_to_27_0EXIT >#106#return; 844#L25-1 assume true; 843#func_to_recursive_line_27_to_27_0EXIT >#108#return; 840#L47-1 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; 825#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 824#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 827#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 805#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 810#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 811#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 804#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 810#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 811#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 804#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 810#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 811#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 803#L25-1 assume true; 806#func_to_recursive_line_27_to_27_0EXIT >#106#return; 820#L25-1 assume true; 847#func_to_recursive_line_27_to_27_0EXIT >#106#return; 844#L25-1 assume true; 843#func_to_recursive_line_27_to_27_0EXIT >#108#return; 840#L47-1 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; 825#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 824#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 827#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 831#L41-1 assume true; 828#func_to_recursive_line_26_to_27_0EXIT >#110#return; 829#L41-1 assume true; 848#func_to_recursive_line_26_to_27_0EXIT >#110#return; 846#L41-1 assume true; 845#func_to_recursive_line_26_to_27_0EXIT >#102#return; 834#L67-1 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; 822#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 832#$Ultimate##0 ~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); 836#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 835#L61-1 assume true; 821#func_to_recursive_line_25_to_26_0EXIT >#104#return; 823#L61-1 assume true; 842#func_to_recursive_line_25_to_26_0EXIT >#98#return; 833#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 813#L92 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);< 818#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 812#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 816#L81-1 assume true; 838#func_to_recursive_line_24_to_25_0EXIT >#100#return; 839#L81-1 assume true; 841#func_to_recursive_line_24_to_25_0EXIT >#112#return; 807#L107-1 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; 809#L112 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);< 830#$Ultimate##0 [2024-11-23 02:53:13,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 6 times [2024-11-23 02:53:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:13,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655075127] [2024-11-23 02:53:13,343 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:53:13,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:13,357 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 02:53:13,357 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:13,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:13,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:13,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash 688040901, now seen corresponding path program 2 times [2024-11-23 02:53:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426318204] [2024-11-23 02:53:13,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:53:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:13,408 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:53:13,408 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-23 02:53:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:13,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426318204] [2024-11-23 02:53:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426318204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:53:13,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251722551] [2024-11-23 02:53:13,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:53:13,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:53:13,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:53:14,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:53:14,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 02:53:14,149 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:53:14,149 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:14,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-23 02:53:14,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:53:14,191 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 [2024-11-23 02:53:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-23 02:53:14,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:53:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-23 02:53:15,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251722551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:53:15,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:53:15,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 34 [2024-11-23 02:53:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418286979] [2024-11-23 02:53:15,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:53:15,369 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-23 02:53:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2024-11-23 02:53:15,371 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 34 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 29 states have internal predecessors, (64), 14 states have call successors, (24), 7 states have call predecessors, (24), 11 states have return successors, (24), 11 states have call predecessors, (24), 14 states have call successors, (24) [2024-11-23 02:53:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:15,959 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-23 02:53:15,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-11-23 02:53:15,960 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:15,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2024-11-23 02:53:15,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-23 02:53:15,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-23 02:53:15,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2024-11-23 02:53:15,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:15,965 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-23 02:53:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2024-11-23 02:53:15,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-23 02:53:15,968 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) [2024-11-23 02:53:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-23 02:53:15,969 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-23 02:53:15,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-23 02:53:15,970 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-23 02:53:15,970 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-23 02:53:15,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2024-11-23 02:53:15,971 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:15,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:15,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:15,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:15,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-23 02:53:15,974 INFO L745 eck$LassoCheckResult]: Stem: 1430#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1411#L-1 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#1(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#4(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); 1400#L128 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);< 1422#$Ultimate##0 [2024-11-23 02:53:15,974 INFO L747 eck$LassoCheckResult]: Loop: 1422#$Ultimate##0 ~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); 1409#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 1405#L107 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);< 1410#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 1404#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 1407#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1424#$Ultimate##0 ~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); 1429#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 1418#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1416#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 1419#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 1397#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1427#L25-1 assume true; 1415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1395#L25-1 assume true; 1398#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1441#L25-1 assume true; 1440#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1437#L25-1 assume true; 1436#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1433#L47-1 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; 1417#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1416#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 1419#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 1397#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1427#L25-1 assume true; 1415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1395#L25-1 assume true; 1398#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1441#L25-1 assume true; 1440#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1437#L25-1 assume true; 1436#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1433#L47-1 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; 1417#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1416#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 1419#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 1397#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1402#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1403#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1427#L25-1 assume true; 1415#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1395#L25-1 assume true; 1398#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1441#L25-1 assume true; 1440#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1437#L25-1 assume true; 1436#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1433#L47-1 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; 1417#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1416#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 1419#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1423#L41-1 assume true; 1420#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1421#L41-1 assume true; 1444#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1443#L41-1 assume true; 1442#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1439#L41-1 assume true; 1438#func_to_recursive_line_26_to_27_0EXIT >#102#return; 1426#L67-1 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; 1413#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1424#$Ultimate##0 ~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); 1429#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1428#L61-1 assume true; 1412#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1414#L61-1 assume true; 1435#func_to_recursive_line_25_to_26_0EXIT >#98#return; 1425#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1406#L92 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);< 1410#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 1404#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1408#L81-1 assume true; 1431#func_to_recursive_line_24_to_25_0EXIT >#100#return; 1432#L81-1 assume true; 1434#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1399#L107-1 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; 1401#L112 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);< 1422#$Ultimate##0 [2024-11-23 02:53:15,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 7 times [2024-11-23 02:53:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:15,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301186420] [2024-11-23 02:53:15,975 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:53:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:15,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:15,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:15,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:15,991 INFO L85 PathProgramCache]: Analyzing trace with hash -12329689, now seen corresponding path program 3 times [2024-11-23 02:53:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:15,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070084344] [2024-11-23 02:53:15,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:53:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:16,008 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-23 02:53:16,009 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-23 02:53:16,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:16,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070084344] [2024-11-23 02:53:16,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070084344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:53:16,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626232717] [2024-11-23 02:53:16,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:53:16,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:53:16,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:53:16,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:53:16,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 02:53:16,341 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-23 02:53:16,342 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:16,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-23 02:53:16,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:53:16,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 02:53:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-23 02:53:16,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:53:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-23 02:53:16,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626232717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:53:16,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:53:16,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 23 [2024-11-23 02:53:16,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135786107] [2024-11-23 02:53:16,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:53:16,877 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:16,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-23 02:53:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-23 02:53:16,878 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 23 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 20 states have internal predecessors, (40), 11 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-23 02:53:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:17,205 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-11-23 02:53:17,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 68 transitions. [2024-11-23 02:53:17,206 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:17,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 68 transitions. [2024-11-23 02:53:17,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-23 02:53:17,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-23 02:53:17,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 68 transitions. [2024-11-23 02:53:17,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:17,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 68 transitions. [2024-11-23 02:53:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 68 transitions. [2024-11-23 02:53:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-11-23 02:53:17,212 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) [2024-11-23 02:53:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-23 02:53:17,212 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-23 02:53:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 02:53:17,213 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-23 02:53:17,214 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-23 02:53:17,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2024-11-23 02:53:17,214 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:17,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:17,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:17,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:17,217 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 27, 27, 27, 12, 12, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:17,217 INFO L745 eck$LassoCheckResult]: Stem: 2228#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2207#L-1 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#1(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#4(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); 2192#L128 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);< 2218#$Ultimate##0 [2024-11-23 02:53:17,218 INFO L747 eck$LassoCheckResult]: Loop: 2218#$Ultimate##0 ~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); 2205#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 2204#L107 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);< 2206#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 2200#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 2202#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2220#$Ultimate##0 ~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); 2224#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 2214#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2195#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2194#L25-1 assume true; 2197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2211#L25-1 assume true; 2243#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2241#L25-1 assume true; 2239#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2234#L25-1 assume true; 2233#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2230#L47-1 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; 2213#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2195#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2194#L25-1 assume true; 2197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2211#L25-1 assume true; 2243#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2241#L25-1 assume true; 2239#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2234#L25-1 assume true; 2233#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2230#L47-1 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; 2213#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2195#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2194#L25-1 assume true; 2197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2211#L25-1 assume true; 2243#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2241#L25-1 assume true; 2239#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2234#L25-1 assume true; 2233#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2230#L47-1 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; 2213#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2219#L41-1 assume true; 2216#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2217#L41-1 assume true; 2229#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2244#L41-1 assume true; 2242#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2237#L41-1 assume true; 2236#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2222#L67-1 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; 2209#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2220#$Ultimate##0 ~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); 2224#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2225#L61-1 assume true; 2208#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2210#L61-1 assume true; 2223#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2221#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 2201#L92 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);< 2206#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 2200#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 2202#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2220#$Ultimate##0 ~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); 2224#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 2214#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2195#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2194#L25-1 assume true; 2197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2211#L25-1 assume true; 2243#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2241#L25-1 assume true; 2239#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2234#L25-1 assume true; 2233#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2230#L47-1 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; 2213#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2195#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2194#L25-1 assume true; 2197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2211#L25-1 assume true; 2243#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2241#L25-1 assume true; 2239#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2234#L25-1 assume true; 2233#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2230#L47-1 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; 2213#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2195#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2194#L25-1 assume true; 2197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2211#L25-1 assume true; 2243#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2241#L25-1 assume true; 2239#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2234#L25-1 assume true; 2233#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2230#L47-1 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; 2213#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2219#L41-1 assume true; 2216#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2217#L41-1 assume true; 2229#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2244#L41-1 assume true; 2242#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2237#L41-1 assume true; 2236#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2222#L67-1 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; 2209#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2220#$Ultimate##0 ~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); 2224#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2225#L61-1 assume true; 2208#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2210#L61-1 assume true; 2223#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2221#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 2201#L92 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);< 2206#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 2200#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 2202#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2220#$Ultimate##0 ~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); 2224#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 2214#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2195#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2194#L25-1 assume true; 2197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2211#L25-1 assume true; 2243#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2241#L25-1 assume true; 2239#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2234#L25-1 assume true; 2233#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2230#L47-1 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; 2213#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2195#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2194#L25-1 assume true; 2197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2211#L25-1 assume true; 2243#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2241#L25-1 assume true; 2239#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2234#L25-1 assume true; 2233#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2230#L47-1 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; 2213#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2195#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2196#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2198#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2199#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2194#L25-1 assume true; 2197#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2211#L25-1 assume true; 2243#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2241#L25-1 assume true; 2239#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2234#L25-1 assume true; 2233#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2230#L47-1 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; 2213#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2212#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 2215#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2219#L41-1 assume true; 2216#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2217#L41-1 assume true; 2229#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2244#L41-1 assume true; 2242#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2237#L41-1 assume true; 2236#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2222#L67-1 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; 2209#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2220#$Ultimate##0 ~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); 2224#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2225#L61-1 assume true; 2208#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2210#L61-1 assume true; 2223#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2221#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 2201#L92 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);< 2206#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 2200#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2203#L81-1 assume true; 2226#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2227#L81-1 assume true; 2240#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2238#L81-1 assume true; 2235#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2232#L81-1 assume true; 2231#func_to_recursive_line_24_to_25_0EXIT >#112#return; 2191#L107-1 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; 2193#L112 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);< 2218#$Ultimate##0 [2024-11-23 02:53:17,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:17,218 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 8 times [2024-11-23 02:53:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:17,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773535878] [2024-11-23 02:53:17,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:53:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:17,226 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:53:17,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:17,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:17,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:17,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:17,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2133161855, now seen corresponding path program 4 times [2024-11-23 02:53:17,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:17,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687166428] [2024-11-23 02:53:17,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:53:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:17,326 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:53:17,326 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3345 backedges. 18 proven. 655 refuted. 0 times theorem prover too weak. 2672 trivial. 0 not checked. [2024-11-23 02:53:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:19,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687166428] [2024-11-23 02:53:19,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687166428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:53:19,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838318359] [2024-11-23 02:53:19,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:53:19,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:53:19,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:53:19,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:53:19,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 02:53:19,743 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:53:19,743 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:19,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 1993 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-23 02:53:19,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:53:19,827 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 [2024-11-23 02:53:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3345 backedges. 1640 proven. 22 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-11-23 02:53:20,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:53:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3345 backedges. 110 proven. 133 refuted. 0 times theorem prover too weak. 3102 trivial. 0 not checked. [2024-11-23 02:53:22,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838318359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:53:22,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:53:22,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 18] total 41 [2024-11-23 02:53:22,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41428906] [2024-11-23 02:53:22,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:53:22,620 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:22,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:22,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-23 02:53:22,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1431, Unknown=0, NotChecked=0, Total=1640 [2024-11-23 02:53:22,622 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 13 Second operand has 41 states, 32 states have (on average 2.6875) internal successors, (86), 35 states have internal predecessors, (86), 18 states have call successors, (37), 8 states have call predecessors, (37), 14 states have return successors, (43), 17 states have call predecessors, (43), 18 states have call successors, (43) [2024-11-23 02:53:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:23,295 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-11-23 02:53:23,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2024-11-23 02:53:23,300 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:23,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2024-11-23 02:53:23,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-23 02:53:23,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-23 02:53:23,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-11-23 02:53:23,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:23,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-23 02:53:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-11-23 02:53:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-23 02:53:23,307 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) [2024-11-23 02:53:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-11-23 02:53:23,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-23 02:53:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-23 02:53:23,313 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-23 02:53:23,313 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-23 02:53:23,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2024-11-23 02:53:23,314 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:23,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:23,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:23,324 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:23,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [60, 60, 48, 48, 48, 15, 15, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:23,324 INFO L745 eck$LassoCheckResult]: Stem: 4265#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 4244#L-1 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#1(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#4(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); 4229#L128 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);< 4255#$Ultimate##0 [2024-11-23 02:53:23,325 INFO L747 eck$LassoCheckResult]: Loop: 4255#$Ultimate##0 ~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); 4242#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 4238#L107 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);< 4243#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 4237#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 4240#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4257#$Ultimate##0 ~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); 4261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 4250#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4256#L41-1 assume true; 4253#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4254#L41-1 assume true; 4285#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4284#L41-1 assume true; 4283#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4282#L41-1 assume true; 4281#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4280#L41-1 assume true; 4279#func_to_recursive_line_26_to_27_0EXIT >#102#return; 4259#L67-1 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; 4246#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4257#$Ultimate##0 ~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); 4261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 4262#L61-1 assume true; 4245#func_to_recursive_line_25_to_26_0EXIT >#104#return; 4247#L61-1 assume true; 4260#func_to_recursive_line_25_to_26_0EXIT >#98#return; 4258#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 4239#L92 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);< 4243#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 4237#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 4240#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4257#$Ultimate##0 ~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); 4261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 4250#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4256#L41-1 assume true; 4253#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4254#L41-1 assume true; 4285#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4284#L41-1 assume true; 4283#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4282#L41-1 assume true; 4281#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4280#L41-1 assume true; 4279#func_to_recursive_line_26_to_27_0EXIT >#102#return; 4259#L67-1 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; 4246#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4257#$Ultimate##0 ~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); 4261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 4262#L61-1 assume true; 4245#func_to_recursive_line_25_to_26_0EXIT >#104#return; 4247#L61-1 assume true; 4260#func_to_recursive_line_25_to_26_0EXIT >#98#return; 4258#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 4239#L92 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);< 4243#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 4237#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 4240#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4257#$Ultimate##0 ~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); 4261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 4250#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4232#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4233#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4231#L25-1 assume true; 4234#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4248#L25-1 assume true; 4278#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4277#L25-1 assume true; 4276#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4274#L25-1 assume true; 4271#func_to_recursive_line_27_to_27_0EXIT >#106#return; 4270#L25-1 assume true; 4269#func_to_recursive_line_27_to_27_0EXIT >#108#return; 4266#L47-1 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; 4251#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4249#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 4252#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4256#L41-1 assume true; 4253#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4254#L41-1 assume true; 4285#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4284#L41-1 assume true; 4283#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4282#L41-1 assume true; 4281#func_to_recursive_line_26_to_27_0EXIT >#110#return; 4280#L41-1 assume true; 4279#func_to_recursive_line_26_to_27_0EXIT >#102#return; 4259#L67-1 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; 4246#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4257#$Ultimate##0 ~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); 4261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 4262#L61-1 assume true; 4245#func_to_recursive_line_25_to_26_0EXIT >#104#return; 4247#L61-1 assume true; 4260#func_to_recursive_line_25_to_26_0EXIT >#98#return; 4258#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 4239#L92 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);< 4243#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 4237#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 4241#L81-1 assume true; 4263#func_to_recursive_line_24_to_25_0EXIT >#100#return; 4264#L81-1 assume true; 4275#func_to_recursive_line_24_to_25_0EXIT >#100#return; 4273#L81-1 assume true; 4272#func_to_recursive_line_24_to_25_0EXIT >#100#return; 4268#L81-1 assume true; 4267#func_to_recursive_line_24_to_25_0EXIT >#112#return; 4228#L107-1 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; 4230#L112 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);< 4255#$Ultimate##0 [2024-11-23 02:53:23,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 9 times [2024-11-23 02:53:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759512633] [2024-11-23 02:53:23,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:53:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:23,347 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-23 02:53:23,347 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:23,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:23,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:23,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1728682071, now seen corresponding path program 5 times [2024-11-23 02:53:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:23,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2515989] [2024-11-23 02:53:23,361 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:53:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:23,687 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-23 02:53:23,687 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8928 backedges. 145 proven. 1270 refuted. 0 times theorem prover too weak. 7513 trivial. 0 not checked. [2024-11-23 02:53:25,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:25,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2515989] [2024-11-23 02:53:25,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2515989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:53:25,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856113453] [2024-11-23 02:53:25,478 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:53:25,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:53:25,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:53:25,481 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:53:25,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 02:53:28,216 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-23 02:53:28,217 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:28,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-23 02:53:28,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:53:28,291 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 [2024-11-23 02:53:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8928 backedges. 2549 proven. 36 refuted. 0 times theorem prover too weak. 6343 trivial. 0 not checked. [2024-11-23 02:53:28,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:53:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8928 backedges. 139 proven. 1292 refuted. 0 times theorem prover too weak. 7497 trivial. 0 not checked. [2024-11-23 02:53:32,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856113453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:53:32,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:53:32,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 22] total 41 [2024-11-23 02:53:32,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295556233] [2024-11-23 02:53:32,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:53:32,222 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:32,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:32,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-23 02:53:32,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1344, Unknown=0, NotChecked=0, Total=1640 [2024-11-23 02:53:32,224 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 41 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 35 states have internal predecessors, (78), 13 states have call successors, (30), 8 states have call predecessors, (30), 13 states have return successors, (37), 11 states have call predecessors, (37), 13 states have call successors, (37) [2024-11-23 02:53:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:32,726 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-23 02:53:32,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 70 transitions. [2024-11-23 02:53:32,727 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:32,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 70 transitions. [2024-11-23 02:53:32,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2024-11-23 02:53:32,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2024-11-23 02:53:32,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2024-11-23 02:53:32,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:32,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-23 02:53:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2024-11-23 02:53:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-23 02:53:32,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 5 states have call predecessors, (10), 18 states have return successors, (22), 18 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-23 02:53:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-23 02:53:32,732 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-23 02:53:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 02:53:32,733 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-23 02:53:32,733 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-23 02:53:32,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 70 transitions. [2024-11-23 02:53:32,734 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:32,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:32,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:32,736 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:32,736 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [84, 84, 72, 72, 72, 15, 15, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:32,736 INFO L745 eck$LassoCheckResult]: Stem: 7121#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 7100#L-1 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#1(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#4(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); 7089#L128 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);< 7111#$Ultimate##0 [2024-11-23 02:53:32,737 INFO L747 eck$LassoCheckResult]: Loop: 7111#$Ultimate##0 ~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); 7098#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 7094#L107 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);< 7099#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 7093#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 7096#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7113#$Ultimate##0 ~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); 7117#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 7107#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7112#L41-1 assume true; 7109#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7110#L41-1 assume true; 7145#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7144#L41-1 assume true; 7143#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7142#L41-1 assume true; 7141#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7140#L41-1 assume true; 7139#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7115#L67-1 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; 7103#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7113#$Ultimate##0 ~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); 7117#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7118#L61-1 assume true; 7102#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7104#L61-1 assume true; 7116#func_to_recursive_line_25_to_26_0EXIT >#98#return; 7114#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 7095#L92 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);< 7099#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 7093#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 7096#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7113#$Ultimate##0 ~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); 7117#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 7107#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7112#L41-1 assume true; 7109#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7110#L41-1 assume true; 7145#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7144#L41-1 assume true; 7143#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7142#L41-1 assume true; 7141#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7140#L41-1 assume true; 7139#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7115#L67-1 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; 7103#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7113#$Ultimate##0 ~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); 7117#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7118#L61-1 assume true; 7102#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7104#L61-1 assume true; 7116#func_to_recursive_line_25_to_26_0EXIT >#98#return; 7114#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 7095#L92 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);< 7099#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 7093#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 7096#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7113#$Ultimate##0 ~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); 7117#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 7107#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 7085#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 7086#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 7091#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 7092#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7084#L25-1 assume true; 7087#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7101#L25-1 assume true; 7138#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7137#L25-1 assume true; 7136#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7135#L25-1 assume true; 7134#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7133#L25-1 assume true; 7132#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7130#L25-1 assume true; 7127#func_to_recursive_line_27_to_27_0EXIT >#106#return; 7126#L25-1 assume true; 7125#func_to_recursive_line_27_to_27_0EXIT >#108#return; 7122#L47-1 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; 7106#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 7105#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 7108#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7112#L41-1 assume true; 7109#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7110#L41-1 assume true; 7145#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7144#L41-1 assume true; 7143#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7142#L41-1 assume true; 7141#func_to_recursive_line_26_to_27_0EXIT >#110#return; 7140#L41-1 assume true; 7139#func_to_recursive_line_26_to_27_0EXIT >#102#return; 7115#L67-1 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; 7103#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 7113#$Ultimate##0 ~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); 7117#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 7118#L61-1 assume true; 7102#func_to_recursive_line_25_to_26_0EXIT >#104#return; 7104#L61-1 assume true; 7116#func_to_recursive_line_25_to_26_0EXIT >#98#return; 7114#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 7095#L92 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);< 7099#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 7093#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 7097#L81-1 assume true; 7119#func_to_recursive_line_24_to_25_0EXIT >#100#return; 7120#L81-1 assume true; 7131#func_to_recursive_line_24_to_25_0EXIT >#100#return; 7129#L81-1 assume true; 7128#func_to_recursive_line_24_to_25_0EXIT >#100#return; 7124#L81-1 assume true; 7123#func_to_recursive_line_24_to_25_0EXIT >#112#return; 7088#L107-1 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; 7090#L112 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);< 7111#$Ultimate##0 [2024-11-23 02:53:32,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 10 times [2024-11-23 02:53:32,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:32,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676571092] [2024-11-23 02:53:32,738 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 02:53:32,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:32,792 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 02:53:32,793 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:32,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:32,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:32,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:32,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1922184407, now seen corresponding path program 6 times [2024-11-23 02:53:32,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:32,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899123612] [2024-11-23 02:53:32,806 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:53:32,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:32,865 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-23 02:53:32,865 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17220 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 17167 trivial. 0 not checked. [2024-11-23 02:53:33,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:33,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899123612] [2024-11-23 02:53:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899123612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:53:33,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467370627] [2024-11-23 02:53:33,085 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:53:33,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:53:33,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:53:33,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:53:33,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 02:53:33,545 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-23 02:53:33,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:53:33,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-23 02:53:33,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:53:33,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 02:53:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 17220 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 17167 trivial. 0 not checked. [2024-11-23 02:53:33,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:53:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 17220 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 17166 trivial. 0 not checked. [2024-11-23 02:53:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467370627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:53:35,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:53:35,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2024-11-23 02:53:35,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271968525] [2024-11-23 02:53:35,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:53:35,895 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:35,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-23 02:53:35,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2024-11-23 02:53:35,896 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. cyclomatic complexity: 13 Second operand has 22 states, 16 states have (on average 3.0625) internal successors, (49), 19 states have internal predecessors, (49), 11 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-23 02:53:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:36,155 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-11-23 02:53:36,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2024-11-23 02:53:36,156 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:36,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 74 transitions. [2024-11-23 02:53:36,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-11-23 02:53:36,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-11-23 02:53:36,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2024-11-23 02:53:36,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:36,157 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-23 02:53:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2024-11-23 02:53:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-23 02:53:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 10 states have call successors, (10), 5 states have call predecessors, (10), 20 states have return successors, (24), 20 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-23 02:53:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-11-23 02:53:36,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-23 02:53:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 02:53:36,167 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-23 02:53:36,167 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-23 02:53:36,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 74 transitions. [2024-11-23 02:53:36,168 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:36,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:36,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:36,175 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:36,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [252, 252, 216, 216, 216, 45, 45, 36, 36, 36, 36, 36, 36, 36, 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] [2024-11-23 02:53:36,176 INFO L745 eck$LassoCheckResult]: Stem: 10679#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10659#L-1 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#1(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#4(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); 10644#L128 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);< 10670#$Ultimate##0 [2024-11-23 02:53:36,178 INFO L747 eck$LassoCheckResult]: Loop: 10670#$Ultimate##0 ~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); 10657#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 10653#L107 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);< 10658#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 10652#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 10655#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 10666#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10671#L41-1 assume true; 10668#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10669#L41-1 assume true; 10708#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10707#L41-1 assume true; 10706#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10705#L41-1 assume true; 10704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10703#L41-1 assume true; 10702#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10674#L67-1 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; 10661#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 10666#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10671#L41-1 assume true; 10668#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10669#L41-1 assume true; 10708#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10707#L41-1 assume true; 10706#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10705#L41-1 assume true; 10704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10703#L41-1 assume true; 10702#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10674#L67-1 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; 10661#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 10666#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10671#L41-1 assume true; 10668#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10669#L41-1 assume true; 10708#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10707#L41-1 assume true; 10706#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10705#L41-1 assume true; 10704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10703#L41-1 assume true; 10702#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10674#L67-1 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; 10661#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 10675#L61-1 assume true; 10660#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10662#L61-1 assume true; 10693#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10692#L61-1 assume true; 10688#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10684#L61-1 assume true; 10683#func_to_recursive_line_25_to_26_0EXIT >#98#return; 10673#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 10654#L92 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);< 10658#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 10652#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 10655#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 10666#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10671#L41-1 assume true; 10668#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10669#L41-1 assume true; 10708#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10707#L41-1 assume true; 10706#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10705#L41-1 assume true; 10704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10703#L41-1 assume true; 10702#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10674#L67-1 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; 10661#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 10666#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10671#L41-1 assume true; 10668#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10669#L41-1 assume true; 10708#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10707#L41-1 assume true; 10706#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10705#L41-1 assume true; 10704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10703#L41-1 assume true; 10702#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10674#L67-1 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; 10661#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 10666#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10671#L41-1 assume true; 10668#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10669#L41-1 assume true; 10708#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10707#L41-1 assume true; 10706#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10705#L41-1 assume true; 10704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10703#L41-1 assume true; 10702#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10674#L67-1 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; 10661#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 10675#L61-1 assume true; 10660#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10662#L61-1 assume true; 10693#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10692#L61-1 assume true; 10688#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10684#L61-1 assume true; 10683#func_to_recursive_line_25_to_26_0EXIT >#98#return; 10673#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 10654#L92 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);< 10658#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 10652#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 10655#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 10666#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10671#L41-1 assume true; 10668#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10669#L41-1 assume true; 10708#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10707#L41-1 assume true; 10706#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10705#L41-1 assume true; 10704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10703#L41-1 assume true; 10702#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10674#L67-1 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; 10661#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 10666#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10671#L41-1 assume true; 10668#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10669#L41-1 assume true; 10708#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10707#L41-1 assume true; 10706#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10705#L41-1 assume true; 10704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10703#L41-1 assume true; 10702#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10674#L67-1 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; 10661#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 10666#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 10648#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 10647#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 10650#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 10651#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10646#L25-1 assume true; 10649#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10663#L25-1 assume true; 10701#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10700#L25-1 assume true; 10699#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10698#L25-1 assume true; 10697#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10696#L25-1 assume true; 10695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10694#L25-1 assume true; 10689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 10686#L25-1 assume true; 10685#func_to_recursive_line_27_to_27_0EXIT >#108#return; 10680#L47-1 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; 10665#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 10664#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 10667#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10671#L41-1 assume true; 10668#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10669#L41-1 assume true; 10708#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10707#L41-1 assume true; 10706#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10705#L41-1 assume true; 10704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 10703#L41-1 assume true; 10702#func_to_recursive_line_26_to_27_0EXIT >#102#return; 10674#L67-1 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; 10661#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 10672#$Ultimate##0 ~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); 10676#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 10675#L61-1 assume true; 10660#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10662#L61-1 assume true; 10693#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10692#L61-1 assume true; 10688#func_to_recursive_line_25_to_26_0EXIT >#104#return; 10684#L61-1 assume true; 10683#func_to_recursive_line_25_to_26_0EXIT >#98#return; 10673#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 10654#L92 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);< 10658#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 10652#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 10656#L81-1 assume true; 10677#func_to_recursive_line_24_to_25_0EXIT >#100#return; 10678#L81-1 assume true; 10691#func_to_recursive_line_24_to_25_0EXIT >#100#return; 10690#L81-1 assume true; 10687#func_to_recursive_line_24_to_25_0EXIT >#100#return; 10682#L81-1 assume true; 10681#func_to_recursive_line_24_to_25_0EXIT >#112#return; 10643#L107-1 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; 10645#L112 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);< 10670#$Ultimate##0 [2024-11-23 02:53:36,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 11 times [2024-11-23 02:53:36,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:36,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863999069] [2024-11-23 02:53:36,181 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 02:53:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:36,190 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 02:53:36,190 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:36,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:36,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:36,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash -365530935, now seen corresponding path program 7 times [2024-11-23 02:53:36,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:36,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923614205] [2024-11-23 02:53:36,198 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:53:36,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 155979 backedges. 23 proven. 1255 refuted. 0 times theorem prover too weak. 154701 trivial. 0 not checked. [2024-11-23 02:53:47,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:53:47,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923614205] [2024-11-23 02:53:47,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923614205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:53:47,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159650601] [2024-11-23 02:53:47,444 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:53:47,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:53:47,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:53:47,447 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:53:47,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 02:53:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 02:53:48,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 9328 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-23 02:53:48,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:53:48,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 02:53:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 155979 backedges. 69670 proven. 15 refuted. 0 times theorem prover too weak. 86294 trivial. 0 not checked. [2024-11-23 02:53:49,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:53:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 155979 backedges. 6 proven. 221 refuted. 0 times theorem prover too weak. 155752 trivial. 0 not checked. [2024-11-23 02:53:55,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159650601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:53:55,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:53:55,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 18] total 42 [2024-11-23 02:53:55,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708447420] [2024-11-23 02:53:55,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:53:55,722 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:53:55,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:53:55,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-23 02:53:55,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1501, Unknown=0, NotChecked=0, Total=1722 [2024-11-23 02:53:55,723 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. cyclomatic complexity: 13 Second operand has 42 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 36 states have internal predecessors, (84), 17 states have call successors, (33), 8 states have call predecessors, (33), 15 states have return successors, (37), 18 states have call predecessors, (37), 17 states have call successors, (37) [2024-11-23 02:53:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:53:56,407 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-23 02:53:56,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 78 transitions. [2024-11-23 02:53:56,408 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:56,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 78 transitions. [2024-11-23 02:53:56,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2024-11-23 02:53:56,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2024-11-23 02:53:56,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 78 transitions. [2024-11-23 02:53:56,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:53:56,410 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-23 02:53:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 78 transitions. [2024-11-23 02:53:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-23 02:53:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 38 states have (on average 1.105263157894737) internal successors, (42), 42 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 22 states have return successors, (26), 22 states have call predecessors, (26), 8 states have call successors, (26) [2024-11-23 02:53:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-23 02:53:56,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-23 02:53:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-23 02:53:56,420 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-23 02:53:56,420 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-23 02:53:56,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 78 transitions. [2024-11-23 02:53:56,421 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:53:56,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:53:56,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:53:56,436 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:53:56,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [420, 420, 360, 360, 360, 72, 72, 60, 60, 60, 60, 60, 60, 60, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:53:56,436 INFO L745 eck$LassoCheckResult]: Stem: 20588#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 20567#L-1 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#1(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#4(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); 20556#L128 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);< 20579#$Ultimate##0 [2024-11-23 02:53:56,441 INFO L747 eck$LassoCheckResult]: Loop: 20579#$Ultimate##0 ~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); 20565#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 20561#L107 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);< 20566#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 20560#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 20563#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 20585#L61-1 assume true; 20569#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20571#L61-1 assume true; 20583#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20605#L61-1 assume true; 20602#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20601#L61-1 assume true; 20597#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20593#L61-1 assume true; 20592#func_to_recursive_line_25_to_26_0EXIT >#98#return; 20581#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 20562#L92 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);< 20566#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 20560#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 20563#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 20585#L61-1 assume true; 20569#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20571#L61-1 assume true; 20583#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20605#L61-1 assume true; 20602#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20601#L61-1 assume true; 20597#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20593#L61-1 assume true; 20592#func_to_recursive_line_25_to_26_0EXIT >#98#return; 20581#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 20562#L92 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);< 20566#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 20560#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 20563#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 20573#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 20553#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 20552#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 20558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 20559#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 20551#L25-1 assume true; 20554#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20568#L25-1 assume true; 20611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20610#L25-1 assume true; 20609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20608#L25-1 assume true; 20607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20606#L25-1 assume true; 20604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20603#L25-1 assume true; 20598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 20595#L25-1 assume true; 20594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 20589#L47-1 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; 20574#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 20572#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 20575#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 20578#L41-1 assume true; 20576#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20577#L41-1 assume true; 20620#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20619#L41-1 assume true; 20618#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20617#L41-1 assume true; 20616#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20615#L41-1 assume true; 20614#func_to_recursive_line_26_to_27_0EXIT >#110#return; 20613#L41-1 assume true; 20612#func_to_recursive_line_26_to_27_0EXIT >#102#return; 20582#L67-1 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; 20570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20580#$Ultimate##0 ~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); 20584#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 20585#L61-1 assume true; 20569#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20571#L61-1 assume true; 20583#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20605#L61-1 assume true; 20602#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20601#L61-1 assume true; 20597#func_to_recursive_line_25_to_26_0EXIT >#104#return; 20593#L61-1 assume true; 20592#func_to_recursive_line_25_to_26_0EXIT >#98#return; 20581#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 20562#L92 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);< 20566#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 20560#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 20564#L81-1 assume true; 20586#func_to_recursive_line_24_to_25_0EXIT >#100#return; 20587#L81-1 assume true; 20600#func_to_recursive_line_24_to_25_0EXIT >#100#return; 20599#L81-1 assume true; 20596#func_to_recursive_line_24_to_25_0EXIT >#100#return; 20591#L81-1 assume true; 20590#func_to_recursive_line_24_to_25_0EXIT >#112#return; 20555#L107-1 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; 20557#L112 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);< 20579#$Ultimate##0 [2024-11-23 02:53:56,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 12 times [2024-11-23 02:53:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:56,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652912170] [2024-11-23 02:53:56,449 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-23 02:53:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:56,462 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-23 02:53:56,463 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 02:53:56,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:53:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:53:56,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:53:56,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:53:56,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1438239184, now seen corresponding path program 8 times [2024-11-23 02:53:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:53:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531748728] [2024-11-23 02:53:56,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:53:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:53:58,339 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:53:58,340 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:54:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 432765 backedges. 30 proven. 2505 refuted. 0 times theorem prover too weak. 430230 trivial. 0 not checked. [2024-11-23 02:54:20,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:54:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531748728] [2024-11-23 02:54:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531748728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:54:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057817931] [2024-11-23 02:54:20,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 02:54:20,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:54:20,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:54:20,462 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:54:20,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 02:54:22,706 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 02:54:22,707 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:54:22,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 15004 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-23 02:54:22,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:54:22,902 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 [2024-11-23 02:54:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 432765 backedges. 2580 proven. 35 refuted. 0 times theorem prover too weak. 430150 trivial. 0 not checked. [2024-11-23 02:54:23,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 02:54:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 432765 backedges. 2540 proven. 90 refuted. 0 times theorem prover too weak. 430135 trivial. 0 not checked. [2024-11-23 02:54:35,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057817931] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 02:54:35,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 02:54:35,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 26] total 44 [2024-11-23 02:54:35,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645405710] [2024-11-23 02:54:35,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 02:54:35,329 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-23 02:54:35,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 02:54:35,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-23 02:54:35,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=1502, Unknown=0, NotChecked=0, Total=1892 [2024-11-23 02:54:35,331 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. cyclomatic complexity: 13 Second operand has 44 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 37 states have internal predecessors, (75), 19 states have call successors, (30), 9 states have call predecessors, (30), 15 states have return successors, (40), 20 states have call predecessors, (40), 19 states have call successors, (40) [2024-11-23 02:54:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 02:54:35,827 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-11-23 02:54:35,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 80 transitions. [2024-11-23 02:54:35,828 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:54:35,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 80 transitions. [2024-11-23 02:54:35,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-11-23 02:54:35,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2024-11-23 02:54:35,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2024-11-23 02:54:35,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-23 02:54:35,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-23 02:54:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2024-11-23 02:54:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-23 02:54:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 43 states have internal predecessors, (43), 10 states have call successors, (10), 5 states have call predecessors, (10), 23 states have return successors, (27), 23 states have call predecessors, (27), 8 states have call successors, (27) [2024-11-23 02:54:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-11-23 02:54:35,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-23 02:54:35,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 02:54:35,833 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-23 02:54:35,833 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-23 02:54:35,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 80 transitions. [2024-11-23 02:54:35,833 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-23 02:54:35,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-23 02:54:35,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-23 02:54:35,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-23 02:54:35,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [504, 504, 432, 432, 432, 84, 84, 72, 72, 72, 72, 72, 72, 72, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 02:54:35,843 INFO L745 eck$LassoCheckResult]: Stem: 36588#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 36568#L-1 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#1(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#4(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); 36557#L128 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);< 36580#$Ultimate##0 [2024-11-23 02:54:35,845 INFO L747 eck$LassoCheckResult]: Loop: 36580#$Ultimate##0 ~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); 36566#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 36562#L107 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);< 36567#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 36561#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 36564#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36584#L61-1 assume true; 36569#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36571#L61-1 assume true; 36612#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36605#L61-1 assume true; 36602#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36601#L61-1 assume true; 36597#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36593#L61-1 assume true; 36592#func_to_recursive_line_25_to_26_0EXIT >#98#return; 36582#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 36563#L92 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);< 36567#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 36561#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 36564#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36584#L61-1 assume true; 36569#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36571#L61-1 assume true; 36612#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36605#L61-1 assume true; 36602#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36601#L61-1 assume true; 36597#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36593#L61-1 assume true; 36592#func_to_recursive_line_25_to_26_0EXIT >#98#return; 36582#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 36563#L92 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);< 36567#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 36561#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 36564#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~d.base, ~d.offset, 4); 36574#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 36554#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 36553#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 36559#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 36560#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 36552#L25-1 assume true; 36555#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36572#L25-1 assume true; 36611#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36610#L25-1 assume true; 36609#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36608#L25-1 assume true; 36607#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36606#L25-1 assume true; 36604#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36603#L25-1 assume true; 36598#func_to_recursive_line_27_to_27_0EXIT >#106#return; 36595#L25-1 assume true; 36594#func_to_recursive_line_27_to_27_0EXIT >#108#return; 36589#L47-1 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; 36575#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 36573#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#3(~d.base, ~d.offset, 4); 36576#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 36579#L41-1 assume true; 36577#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36578#L41-1 assume true; 36623#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36622#L41-1 assume true; 36621#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36620#L41-1 assume true; 36619#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36618#L41-1 assume true; 36617#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36616#L41-1 assume true; 36615#func_to_recursive_line_26_to_27_0EXIT >#110#return; 36614#L41-1 assume true; 36613#func_to_recursive_line_26_to_27_0EXIT >#102#return; 36583#L67-1 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; 36570#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 36581#$Ultimate##0 ~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); 36585#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 36584#L61-1 assume true; 36569#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36571#L61-1 assume true; 36612#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36605#L61-1 assume true; 36602#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36601#L61-1 assume true; 36597#func_to_recursive_line_25_to_26_0EXIT >#104#return; 36593#L61-1 assume true; 36592#func_to_recursive_line_25_to_26_0EXIT >#98#return; 36582#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 36563#L92 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);< 36567#$Ultimate##0 ~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#1(~b.base, ~b.offset, 4); 36561#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 36565#L81-1 assume true; 36586#func_to_recursive_line_24_to_25_0EXIT >#100#return; 36587#L81-1 assume true; 36600#func_to_recursive_line_24_to_25_0EXIT >#100#return; 36599#L81-1 assume true; 36596#func_to_recursive_line_24_to_25_0EXIT >#100#return; 36591#L81-1 assume true; 36590#func_to_recursive_line_24_to_25_0EXIT >#112#return; 36556#L107-1 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; 36558#L112 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);< 36580#$Ultimate##0 [2024-11-23 02:54:35,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:54:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 13 times [2024-11-23 02:54:35,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:54:35,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997307316] [2024-11-23 02:54:35,846 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-23 02:54:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:54:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:54:35,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 02:54:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 02:54:35,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 02:54:35,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 02:54:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash 135570896, now seen corresponding path program 9 times [2024-11-23 02:54:35,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 02:54:35,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075543059] [2024-11-23 02:54:35,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:54:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 02:54:36,100 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-23 02:54:36,100 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:54:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 622383 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 622366 trivial. 0 not checked. [2024-11-23 02:54:36,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 02:54:36,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075543059] [2024-11-23 02:54:36,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075543059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 02:54:36,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469938136] [2024-11-23 02:54:36,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 02:54:36,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 02:54:36,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 02:54:36,766 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 02:54:36,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 02:54:37,758 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-23 02:54:37,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 02:54:37,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-23 02:54:37,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 02:54:37,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 02:54:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 622383 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 622368 trivial. 0 not checked. [2024-11-23 02:54:38,070 INFO L311 TraceCheckSpWp]: Computing backward predicates...