./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.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 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:43:41,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:43:41,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-13 17:43:41,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:43:41,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:43:41,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:43:41,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:43:41,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:43:41,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:43:41,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:43:41,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:43:41,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:43:41,949 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:43:41,950 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:43:41,950 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:43:41,951 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:43:41,951 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:43:41,951 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:43:41,952 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:43:41,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:43:41,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:43:41,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 17:43:41,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:43:41,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 17:43:41,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:43:41,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:43:41,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:43:41,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:43:41,959 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:43:41,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:43:41,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 17:43:41,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:43:41,961 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:43:41,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:43:41,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:43:41,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:43:41,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:43:41,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:43:41,963 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:43:41,963 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 -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2024-10-13 17:43:42,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:43:42,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:43:42,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:43:42,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:43:42,253 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:43:42,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-10-13 17:43:43,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:43:43,972 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:43:43,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2024-10-13 17:43:43,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483392cbb/5d9064f0a72248c3ab2d934c33a137a5/FLAG36dead5f4 [2024-10-13 17:43:43,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/483392cbb/5d9064f0a72248c3ab2d934c33a137a5 [2024-10-13 17:43:43,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:43:43,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:43:44,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:43:44,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:43:44,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:43:44,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:43:43" (1/1) ... [2024-10-13 17:43:44,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4847fe24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44, skipping insertion in model container [2024-10-13 17:43:44,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:43:43" (1/1) ... [2024-10-13 17:43:44,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:43:44,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:43:44,262 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:43:44,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:43:44,316 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:43:44,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44 WrapperNode [2024-10-13 17:43:44,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:43:44,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:43:44,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:43:44,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:43:44,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,364 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-10-13 17:43:44,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:43:44,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:43:44,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:43:44,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:43:44,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,405 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2024-10-13 17:43:44,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:43:44,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:43:44,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:43:44,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:43:44,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (1/1) ... [2024-10-13 17:43:44,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:43:44,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:43:44,468 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-10-13 17:43:44,475 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-10-13 17:43:44,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 17:43:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2024-10-13 17:43:44,524 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2024-10-13 17:43:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 17:43:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 17:43:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 17:43:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 17:43:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 17:43:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 17:43:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:43:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 17:43:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 17:43:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 17:43:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 17:43:44,527 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-10-13 17:43:44,527 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-10-13 17:43:44,528 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2024-10-13 17:43:44,528 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2024-10-13 17:43:44,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:43:44,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:43:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:43:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 17:43:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 17:43:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 17:43:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 17:43:44,529 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-10-13 17:43:44,529 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-10-13 17:43:44,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:43:44,655 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:43:44,658 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:43:44,976 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-13 17:43:44,976 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:43:45,013 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:43:45,013 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 17:43:45,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:43:45 BoogieIcfgContainer [2024-10-13 17:43:45,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:43:45,015 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:43:45,015 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:43:45,019 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:43:45,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:43:45,020 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:43:43" (1/3) ... [2024-10-13 17:43:45,021 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26893ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:43:45, skipping insertion in model container [2024-10-13 17:43:45,021 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:43:45,021 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:43:44" (2/3) ... [2024-10-13 17:43:45,022 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26893ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:43:45, skipping insertion in model container [2024-10-13 17:43:45,022 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:43:45,022 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:43:45" (3/3) ... [2024-10-13 17:43:45,023 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2024-10-13 17:43:45,091 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:43:45,091 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:43:45,091 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:43:45,092 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:43:45,092 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:43:45,092 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:43:45,092 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:43:45,092 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:43:45,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 17:43:45,120 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-13 17:43:45,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:43:45,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:43:45,127 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:43:45,127 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:43:45,128 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:43:45,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 17:43:45,133 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-13 17:43:45,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:43:45,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:43:45,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:43:45,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-13 17:43:45,144 INFO L745 eck$LassoCheckResult]: Stem: 44#$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); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 34#L109-2true [2024-10-13 17:43:45,145 INFO L747 eck$LassoCheckResult]: Loop: 34#L109-2true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L114-2true assume !(main_~b~0#1 < 6); 5#L114-3true main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 34#L109-2true [2024-10-13 17:43:45,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-10-13 17:43:45,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:45,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941176323] [2024-10-13 17:43:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:45,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:43:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:45,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:43:45,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash 71729, now seen corresponding path program 1 times [2024-10-13 17:43:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:45,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845048418] [2024-10-13 17:43:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:43:45,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:43:45,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845048418] [2024-10-13 17:43:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845048418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:43:45,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:43:45,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:43:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855296626] [2024-10-13 17:43:45,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:43:45,426 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:43:45,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:43:45,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 17:43:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 17:43:45,457 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 17:43:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:43:45,487 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-10-13 17:43:45,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2024-10-13 17:43:45,491 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2024-10-13 17:43:45,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 46 transitions. [2024-10-13 17:43:45,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-13 17:43:45,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-13 17:43:45,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2024-10-13 17:43:45,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:43:45,502 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-10-13 17:43:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2024-10-13 17:43:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-13 17:43:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 17:43:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-10-13 17:43:45,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-10-13 17:43:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 17:43:45,545 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-10-13 17:43:45,546 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:43:45,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2024-10-13 17:43:45,548 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:43:45,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:43:45,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:43:45,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:43:45,549 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:43:45,549 INFO L745 eck$LassoCheckResult]: Stem: 138#$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); 120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 109#L109-2 [2024-10-13 17:43:45,551 INFO L747 eck$LassoCheckResult]: Loop: 109#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 118#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 119#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 135#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 134#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 124#L81-1 assume true; 121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 123#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 136#L114-2 assume !(main_~b~0#1 < 6); 108#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 109#L109-2 [2024-10-13 17:43:45,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2024-10-13 17:43:45,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:45,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588030777] [2024-10-13 17:43:45,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:45,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:45,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:43:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:45,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:43:45,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1371427203, now seen corresponding path program 1 times [2024-10-13 17:43:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:45,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688662606] [2024-10-13 17:43:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:45,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:43:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:43:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688662606] [2024-10-13 17:43:45,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688662606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:43:45,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:43:45,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 17:43:45,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487030443] [2024-10-13 17:43:45,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:43:45,944 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:43:45,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:43:45,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 17:43:45,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 17:43:45,945 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 17:43:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:43:46,216 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-10-13 17:43:46,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2024-10-13 17:43:46,218 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:43:46,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2024-10-13 17:43:46,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-13 17:43:46,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-13 17:43:46,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2024-10-13 17:43:46,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:43:46,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-10-13 17:43:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2024-10-13 17:43:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-10-13 17:43:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-13 17:43:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-13 17:43:46,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-13 17:43:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 17:43:46,227 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-13 17:43:46,227 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:43:46,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2024-10-13 17:43:46,230 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:43:46,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:43:46,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:43:46,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:43:46,233 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 17:43:46,233 INFO L745 eck$LassoCheckResult]: Stem: 232#$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); 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 205#L109-2 [2024-10-13 17:43:46,234 INFO L747 eck$LassoCheckResult]: Loop: 205#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 212#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 213#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 227#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 202#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 203#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 220#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 223#L61-1 assume true; 224#func_to_recursive_line_26_to_27_0EXIT >#115#return; 225#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 215#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 227#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 222#L81-1 assume true; 214#func_to_recursive_line_25_to_26_0EXIT >#117#return; 216#L81-1 assume true; 233#func_to_recursive_line_25_to_26_0EXIT >#123#return; 229#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 230#L114-2 assume !(main_~b~0#1 < 6); 204#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 205#L109-2 [2024-10-13 17:43:46,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2024-10-13 17:43:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:46,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325865702] [2024-10-13 17:43:46,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:46,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:43:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:46,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:43:46,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash 182328154, now seen corresponding path program 1 times [2024-10-13 17:43:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:46,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701166963] [2024-10-13 17:43:46,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:46,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 17:43:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 17:43:46,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:43:46,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701166963] [2024-10-13 17:43:46,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701166963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:43:46,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:43:46,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 17:43:46,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109427997] [2024-10-13 17:43:46,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:43:46,796 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:43:46,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:43:46,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 17:43:46,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 17:43:46,798 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 17:43:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:43:46,989 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-10-13 17:43:46,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2024-10-13 17:43:46,991 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:43:46,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 53 transitions. [2024-10-13 17:43:46,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-13 17:43:46,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-13 17:43:46,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-10-13 17:43:46,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:43:46,996 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-13 17:43:46,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-10-13 17:43:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-13 17:43:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-13 17:43:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-10-13 17:43:47,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-13 17:43:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 17:43:47,005 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-13 17:43:47,005 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:43:47,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-10-13 17:43:47,007 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:43:47,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:43:47,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:43:47,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:43:47,009 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, 1] [2024-10-13 17:43:47,009 INFO L745 eck$LassoCheckResult]: Stem: 348#$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); 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 320#L109-2 [2024-10-13 17:43:47,010 INFO L747 eck$LassoCheckResult]: Loop: 320#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 327#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 328#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 344#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 342#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 317#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 335#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 314#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 332#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 333#L41-1 assume true; 334#func_to_recursive_line_27_to_28_0EXIT >#125#return; 341#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 316#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 318#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 335#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 338#L61-1 assume true; 339#func_to_recursive_line_26_to_27_0EXIT >#127#return; 340#L61-1 assume true; 349#func_to_recursive_line_26_to_27_0EXIT >#115#return; 343#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 330#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 344#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 342#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 337#L81-1 assume true; 329#func_to_recursive_line_25_to_26_0EXIT >#117#return; 331#L81-1 assume true; 350#func_to_recursive_line_25_to_26_0EXIT >#123#return; 345#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 346#L114-2 assume !(main_~b~0#1 < 6); 319#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 320#L109-2 [2024-10-13 17:43:47,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:47,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2024-10-13 17:43:47,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:47,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124427235] [2024-10-13 17:43:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:47,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:43:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:47,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:43:47,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:47,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2098832724, now seen corresponding path program 1 times [2024-10-13 17:43:47,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:47,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750032121] [2024-10-13 17:43:47,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:47,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:47,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:47,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 17:43:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 17:43:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 17:43:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:43:47,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750032121] [2024-10-13 17:43:47,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750032121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:43:47,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:43:47,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 17:43:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244512414] [2024-10-13 17:43:47,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:43:47,490 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:43:47,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:43:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 17:43:47,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 17:43:47,493 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 17:43:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:43:47,677 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-10-13 17:43:47,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-10-13 17:43:47,679 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:43:47,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-10-13 17:43:47,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-13 17:43:47,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-13 17:43:47,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-10-13 17:43:47,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:43:47,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-10-13 17:43:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-10-13 17:43:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-13 17:43:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-13 17:43:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-10-13 17:43:47,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-13 17:43:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 17:43:47,694 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-13 17:43:47,694 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:43:47,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-10-13 17:43:47,695 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:43:47,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:43:47,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:43:47,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:43:47,698 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, 1] [2024-10-13 17:43:47,699 INFO L745 eck$LassoCheckResult]: Stem: 497#$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); 476#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 468#L109-2 [2024-10-13 17:43:47,699 INFO L747 eck$LassoCheckResult]: Loop: 468#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 474#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 475#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 492#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 490#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 465#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 483#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 463#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 473#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 480#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 470#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 469#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 472#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 484#L25-1 assume true; 496#func_to_recursive_line_28_to_28_0EXIT >#119#return; 461#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 462#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 473#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 480#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 481#L41-1 assume true; 482#func_to_recursive_line_27_to_28_0EXIT >#121#return; 489#L41-1 assume true; 498#func_to_recursive_line_27_to_28_0EXIT >#125#return; 493#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 464#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 466#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 483#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 486#L61-1 assume true; 487#func_to_recursive_line_26_to_27_0EXIT >#127#return; 488#L61-1 assume true; 499#func_to_recursive_line_26_to_27_0EXIT >#115#return; 491#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 478#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 492#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 490#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 485#L81-1 assume true; 477#func_to_recursive_line_25_to_26_0EXIT >#117#return; 479#L81-1 assume true; 500#func_to_recursive_line_25_to_26_0EXIT >#123#return; 494#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 495#L114-2 assume !(main_~b~0#1 < 6); 467#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 468#L109-2 [2024-10-13 17:43:47,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:47,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2024-10-13 17:43:47,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:47,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181739485] [2024-10-13 17:43:47,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:47,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:47,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:43:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:47,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:43:47,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash 500602406, now seen corresponding path program 1 times [2024-10-13 17:43:47,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:47,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420116557] [2024-10-13 17:43:47,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:47,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:47,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 17:43:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 17:43:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 17:43:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 17:43:48,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:43:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420116557] [2024-10-13 17:43:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420116557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:43:48,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:43:48,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 17:43:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922526181] [2024-10-13 17:43:48,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:43:48,222 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:43:48,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:43:48,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 17:43:48,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 17:43:48,223 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-13 17:43:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:43:48,397 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-13 17:43:48,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-10-13 17:43:48,399 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:43:48,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-10-13 17:43:48,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-13 17:43:48,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-13 17:43:48,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-10-13 17:43:48,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:43:48,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-13 17:43:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-10-13 17:43:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 17:43:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-13 17:43:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-10-13 17:43:48,412 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-13 17:43:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 17:43:48,413 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-13 17:43:48,413 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:43:48,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2024-10-13 17:43:48,415 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2024-10-13 17:43:48,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:43:48,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:43:48,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:43:48,419 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, 1] [2024-10-13 17:43:48,420 INFO L745 eck$LassoCheckResult]: Stem: 691#$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); 668#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 660#L109-2 [2024-10-13 17:43:48,420 INFO L747 eck$LassoCheckResult]: Loop: 660#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 666#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 667#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 684#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 682#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 657#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 675#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 654#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 665#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 672#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 662#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 661#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 664#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 663#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 661#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 664#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 676#L25-1 assume true; 690#func_to_recursive_line_28_to_28_0EXIT >#113#return; 688#L25-1 assume true; 689#func_to_recursive_line_28_to_28_0EXIT >#119#return; 653#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 655#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 665#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 672#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 673#L41-1 assume true; 674#func_to_recursive_line_27_to_28_0EXIT >#121#return; 681#L41-1 assume true; 692#func_to_recursive_line_27_to_28_0EXIT >#125#return; 685#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 656#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 658#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 675#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 678#L61-1 assume true; 679#func_to_recursive_line_26_to_27_0EXIT >#127#return; 680#L61-1 assume true; 693#func_to_recursive_line_26_to_27_0EXIT >#115#return; 683#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 670#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 684#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 682#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 677#L81-1 assume true; 669#func_to_recursive_line_25_to_26_0EXIT >#117#return; 671#L81-1 assume true; 694#func_to_recursive_line_25_to_26_0EXIT >#123#return; 686#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 687#L114-2 assume !(main_~b~0#1 < 6); 659#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 660#L109-2 [2024-10-13 17:43:48,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2024-10-13 17:43:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:48,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446945566] [2024-10-13 17:43:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:48,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:48,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:43:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:48,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:43:48,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:48,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1994055486, now seen corresponding path program 1 times [2024-10-13 17:43:48,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117286675] [2024-10-13 17:43:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 17:43:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 17:43:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 17:43:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:43:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117286675] [2024-10-13 17:43:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117286675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:43:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100358645] [2024-10-13 17:43:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:48,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:43:48,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:43:48,645 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-10-13 17:43:48,647 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-10-13 17:43:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:48,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 17:43:48,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:43:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 17:43:48,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:43:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 17:43:48,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100358645] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:43:48,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:43:48,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2024-10-13 17:43:48,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103909432] [2024-10-13 17:43:48,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:43:48,976 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:43:48,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:43:48,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 17:43:48,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 17:43:48,977 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. cyclomatic complexity: 14 Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-13 17:43:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:43:49,121 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2024-10-13 17:43:49,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2024-10-13 17:43:49,122 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-10-13 17:43:49,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 63 transitions. [2024-10-13 17:43:49,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-10-13 17:43:49,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-10-13 17:43:49,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2024-10-13 17:43:49,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:43:49,125 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-10-13 17:43:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2024-10-13 17:43:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 17:43:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-13 17:43:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2024-10-13 17:43:49,129 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-10-13 17:43:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 17:43:49,130 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-10-13 17:43:49,130 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:43:49,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 63 transitions. [2024-10-13 17:43:49,131 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-10-13 17:43:49,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:43:49,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:43:49,134 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:43:49,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2024-10-13 17:43:49,134 INFO L745 eck$LassoCheckResult]: Stem: 1200#$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); 1174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 1163#L109-2 [2024-10-13 17:43:49,135 INFO L747 eck$LassoCheckResult]: Loop: 1163#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1172#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1173#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1195#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1196#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1179#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1205#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1207#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1177#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1204#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1206#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1178#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 1165#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 1160#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 1168#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1169#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1167#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 1170#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1185#L25-1 assume true; 1199#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1197#L25-1 assume true; 1198#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1159#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1161#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 1181#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1182#L41-1 assume true; 1183#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1190#L41-1 assume true; 1208#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1194#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1164#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1166#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 1184#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1187#L61-1 assume true; 1188#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1189#L61-1 assume true; 1209#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1192#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1176#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1193#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 1191#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1186#L81-1 assume true; 1175#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1180#L81-1 assume true; 1203#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1202#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1201#L114-2 assume !(main_~b~0#1 < 6); 1162#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 1163#L109-2 [2024-10-13 17:43:49,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:49,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2024-10-13 17:43:49,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:49,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258896032] [2024-10-13 17:43:49,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:49,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:49,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:43:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:49,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:43:49,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2143273103, now seen corresponding path program 2 times [2024-10-13 17:43:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:49,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190008013] [2024-10-13 17:43:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:49,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:49,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:49,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:49,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:49,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:49,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:49,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 17:43:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:49,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 17:43:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:49,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 17:43:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 17:43:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 17:43:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 17:43:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 17:43:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 17:43:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 17:43:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 17:43:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 17:43:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 45 proven. 59 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-10-13 17:43:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:43:50,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190008013] [2024-10-13 17:43:50,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190008013] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:43:50,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425361582] [2024-10-13 17:43:50,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:43:50,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:43:50,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:43:50,738 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-10-13 17:43:50,740 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-10-13 17:43:51,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:43:51,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:43:51,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 17:43:51,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:43:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-10-13 17:43:51,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:43:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-10-13 17:43:51,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425361582] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:43:51,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:43:51,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-10-13 17:43:51,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398596467] [2024-10-13 17:43:51,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:43:51,581 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:43:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:43:51,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 17:43:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-13 17:43:51,584 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. cyclomatic complexity: 17 Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 14 states have internal predecessors, (56), 10 states have call successors, (26), 5 states have call predecessors, (26), 4 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-13 17:43:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:43:52,019 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-10-13 17:43:52,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 73 transitions. [2024-10-13 17:43:52,020 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-13 17:43:52,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 73 transitions. [2024-10-13 17:43:52,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-13 17:43:52,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-13 17:43:52,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 73 transitions. [2024-10-13 17:43:52,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:43:52,022 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-10-13 17:43:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 73 transitions. [2024-10-13 17:43:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 17:43:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 13 states have call successors, (13), 4 states have call predecessors, (13), 9 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2024-10-13 17:43:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2024-10-13 17:43:52,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-10-13 17:43:52,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 17:43:52,028 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-10-13 17:43:52,028 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:43:52,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 73 transitions. [2024-10-13 17:43:52,029 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-13 17:43:52,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:43:52,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:43:52,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:43:52,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-13 17:43:52,042 INFO L745 eck$LassoCheckResult]: Stem: 2906#$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); 2877#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 2869#L109-2 [2024-10-13 17:43:52,043 INFO L747 eck$LassoCheckResult]: Loop: 2869#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2875#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2876#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2901#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2902#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2884#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2916#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2920#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2879#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2913#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2919#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2880#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2914#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2918#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2881#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2915#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2917#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2883#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 2866#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 2863#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 2871#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2872#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2870#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 2873#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2889#L25-1 assume true; 2905#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2903#L25-1 assume true; 2904#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2862#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2864#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2874#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 2886#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2887#L41-1 assume true; 2888#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2895#L41-1 assume true; 2909#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2908#L41-1 assume true; 2907#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2900#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2865#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2867#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 2890#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2892#L61-1 assume true; 2893#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2894#L61-1 assume true; 2910#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2898#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2882#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2899#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 2896#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2897#L81-1 assume true; 2878#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2885#L81-1 assume true; 2891#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2912#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 2911#L114-2 assume !(main_~b~0#1 < 6); 2868#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 2869#L109-2 [2024-10-13 17:43:52,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2024-10-13 17:43:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:52,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477317460] [2024-10-13 17:43:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:52,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:52,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:43:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:52,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:43:52,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1922248367, now seen corresponding path program 3 times [2024-10-13 17:43:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957199098] [2024-10-13 17:43:52,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:43:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:43:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 17:43:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:43:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:43:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 17:43:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:43:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:43:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 17:43:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:43:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:43:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-13 17:43:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:43:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:43:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-13 17:43:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:43:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:43:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:43:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:43:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:43:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2649 backedges. 61 proven. 48 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2024-10-13 17:43:54,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:43:54,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957199098] [2024-10-13 17:43:54,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957199098] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:43:54,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588152213] [2024-10-13 17:43:54,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 17:43:54,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:43:54,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:43:54,230 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-10-13 17:43:54,231 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-10-13 17:43:54,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 17:43:54,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:43:54,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 17:43:54,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:43:54,551 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-10-13 17:43:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2649 backedges. 111 proven. 3 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2024-10-13 17:43:54,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:43:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2649 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 2534 trivial. 0 not checked. [2024-10-13 17:43:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588152213] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:43:55,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:43:55,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 26 [2024-10-13 17:43:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843146436] [2024-10-13 17:43:55,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:43:55,689 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:43:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:43:55,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 17:43:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2024-10-13 17:43:55,690 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. cyclomatic complexity: 19 Second operand has 26 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 11 states have call successors, (26), 8 states have call predecessors, (26), 6 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-13 17:43:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:43:56,112 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-10-13 17:43:56,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2024-10-13 17:43:56,113 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-13 17:43:56,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 77 transitions. [2024-10-13 17:43:56,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-10-13 17:43:56,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2024-10-13 17:43:56,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 77 transitions. [2024-10-13 17:43:56,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:43:56,115 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-10-13 17:43:56,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 77 transitions. [2024-10-13 17:43:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 17:43:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 13 states have call successors, (13), 4 states have call predecessors, (13), 11 states have return successors, (20), 16 states have call predecessors, (20), 13 states have call successors, (20) [2024-10-13 17:43:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2024-10-13 17:43:56,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-10-13 17:43:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 17:43:56,121 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-10-13 17:43:56,121 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-13 17:43:56,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 77 transitions. [2024-10-13 17:43:56,122 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-13 17:43:56,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:43:56,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:43:56,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:43:56,129 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 72, 54, 54, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-13 17:43:56,129 INFO L745 eck$LassoCheckResult]: Stem: 6470#$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); 6442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 6431#L109-2 [2024-10-13 17:43:56,130 INFO L747 eck$LassoCheckResult]: Loop: 6431#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 6440#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6441#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6465#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 6466#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6447#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6476#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 6487#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6449#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6478#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 6484#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6444#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6474#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 6482#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6445#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6475#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 6479#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 6446#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 6433#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 6428#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 6436#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 6437#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 6435#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 6438#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6455#L25-1 assume true; 6469#func_to_recursive_line_28_to_28_0EXIT >#113#return; 6467#L25-1 assume true; 6468#func_to_recursive_line_28_to_28_0EXIT >#119#return; 6427#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 6429#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 6439#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 6451#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6452#L41-1 assume true; 6453#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6460#L41-1 assume true; 6488#func_to_recursive_line_27_to_28_0EXIT >#121#return; 6486#L41-1 assume true; 6485#func_to_recursive_line_27_to_28_0EXIT >#125#return; 6464#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 6432#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6434#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 6454#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6457#L61-1 assume true; 6458#func_to_recursive_line_26_to_27_0EXIT >#127#return; 6459#L61-1 assume true; 6489#func_to_recursive_line_26_to_27_0EXIT >#115#return; 6462#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 6448#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 6463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 6461#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6456#L81-1 assume true; 6443#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6450#L81-1 assume true; 6483#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6481#L81-1 assume true; 6480#func_to_recursive_line_25_to_26_0EXIT >#117#return; 6477#L81-1 assume true; 6473#func_to_recursive_line_25_to_26_0EXIT >#123#return; 6472#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 6471#L114-2 assume !(main_~b~0#1 < 6); 6430#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 6431#L109-2 [2024-10-13 17:43:56,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2024-10-13 17:43:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:56,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300880165] [2024-10-13 17:43:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:56,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:43:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:43:56,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:43:56,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:43:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 821301521, now seen corresponding path program 4 times [2024-10-13 17:43:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:43:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248556386] [2024-10-13 17:43:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:43:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:43:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:01,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:01,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:01,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:01,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:01,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:01,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:01,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:01,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:01,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:01,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 17:44:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-10-13 17:44:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-10-13 17:44:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:02,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 678 [2024-10-13 17:44:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2024-10-13 17:44:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 17:44:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 17:44:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 17:44:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 23061 backedges. 38 proven. 1102 refuted. 0 times theorem prover too weak. 21921 trivial. 0 not checked. [2024-10-13 17:44:03,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:44:03,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248556386] [2024-10-13 17:44:03,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248556386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:44:03,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133926745] [2024-10-13 17:44:03,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 17:44:03,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:44:03,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:44:03,569 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-10-13 17:44:03,571 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-10-13 17:44:04,901 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 17:44:04,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:44:04,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 7028 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-13 17:44:04,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:44:05,009 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-10-13 17:44:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 23061 backedges. 10765 proven. 38 refuted. 0 times theorem prover too weak. 12258 trivial. 0 not checked. [2024-10-13 17:44:05,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:44:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 23061 backedges. 305 proven. 215 refuted. 0 times theorem prover too weak. 22541 trivial. 0 not checked. [2024-10-13 17:44:08,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133926745] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:44:08,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:44:08,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 18] total 42 [2024-10-13 17:44:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015188554] [2024-10-13 17:44:08,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:44:08,410 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:44:08,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:44:08,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-13 17:44:08,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1520, Unknown=0, NotChecked=0, Total=1722 [2024-10-13 17:44:08,412 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. cyclomatic complexity: 19 Second operand has 42 states, 32 states have (on average 2.8125) internal successors, (90), 33 states have internal predecessors, (90), 18 states have call successors, (46), 11 states have call predecessors, (46), 13 states have return successors, (41), 16 states have call predecessors, (41), 18 states have call successors, (41) [2024-10-13 17:44:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:44:09,284 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2024-10-13 17:44:09,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 81 transitions. [2024-10-13 17:44:09,285 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-13 17:44:09,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 81 transitions. [2024-10-13 17:44:09,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-10-13 17:44:09,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-10-13 17:44:09,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 81 transitions. [2024-10-13 17:44:09,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:44:09,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-10-13 17:44:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 81 transitions. [2024-10-13 17:44:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-13 17:44:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 13 states have return successors, (22), 18 states have call predecessors, (22), 13 states have call successors, (22) [2024-10-13 17:44:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-10-13 17:44:09,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-10-13 17:44:09,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 17:44:09,297 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-10-13 17:44:09,297 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-13 17:44:09,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 81 transitions. [2024-10-13 17:44:09,298 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-13 17:44:09,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:44:09,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:44:09,313 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:44:09,313 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [144, 144, 96, 96, 96, 72, 72, 48, 48, 48, 48, 48, 48, 48, 48, 48, 30, 30, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-13 17:44:09,314 INFO L745 eck$LassoCheckResult]: Stem: 17276#$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); 17249#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 17241#L109-2 [2024-10-13 17:44:09,319 INFO L747 eck$LassoCheckResult]: Loop: 17241#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 17247#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17248#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17272#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17273#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17252#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17287#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17299#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17253#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17288#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17298#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17254#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17289#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17294#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17255#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17290#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17291#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 17256#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 17238#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 17235#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 17244#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 17243#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 17242#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 17245#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 17262#L25-1 assume true; 17274#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17275#L25-1 assume true; 17300#func_to_recursive_line_28_to_28_0EXIT >#113#return; 17278#L25-1 assume true; 17277#func_to_recursive_line_28_to_28_0EXIT >#119#return; 17234#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 17236#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 17246#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 17258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 17259#L41-1 assume true; 17260#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17267#L41-1 assume true; 17282#func_to_recursive_line_27_to_28_0EXIT >#121#return; 17280#L41-1 assume true; 17279#func_to_recursive_line_27_to_28_0EXIT >#125#return; 17271#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 17237#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17239#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 17261#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 17264#L61-1 assume true; 17265#func_to_recursive_line_26_to_27_0EXIT >#127#return; 17266#L61-1 assume true; 17281#func_to_recursive_line_26_to_27_0EXIT >#115#return; 17269#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 17251#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 17270#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 17268#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 17263#L81-1 assume true; 17250#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17257#L81-1 assume true; 17297#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17296#L81-1 assume true; 17295#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17293#L81-1 assume true; 17292#func_to_recursive_line_25_to_26_0EXIT >#117#return; 17286#L81-1 assume true; 17285#func_to_recursive_line_25_to_26_0EXIT >#123#return; 17284#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 17283#L114-2 assume !(main_~b~0#1 < 6); 17240#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 17241#L109-2 [2024-10-13 17:44:09,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:44:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times [2024-10-13 17:44:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:44:09,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802339647] [2024-10-13 17:44:09,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:44:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:44:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:44:09,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:44:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:44:09,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:44:09,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:44:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash 506403377, now seen corresponding path program 5 times [2024-10-13 17:44:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:44:09,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192433753] [2024-10-13 17:44:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:44:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:44:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:15,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:16,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-13 17:44:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 528 [2024-10-13 17:44:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:17,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 791 [2024-10-13 17:44:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1054 [2024-10-13 17:44:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:18,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1317 [2024-10-13 17:44:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 17:44:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 17:44:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 17:44:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 67311 backedges. 60 proven. 2317 refuted. 0 times theorem prover too weak. 64934 trivial. 0 not checked. [2024-10-13 17:44:19,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:44:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192433753] [2024-10-13 17:44:19,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192433753] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:44:19,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979594109] [2024-10-13 17:44:19,588 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 17:44:19,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:44:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:44:19,590 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-10-13 17:44:19,592 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-10-13 17:44:20,387 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-13 17:44:20,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:44:20,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 17:44:20,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:44:20,428 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-10-13 17:44:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 67311 backedges. 7516 proven. 8 refuted. 0 times theorem prover too weak. 59787 trivial. 0 not checked. [2024-10-13 17:44:20,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:44:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 67311 backedges. 129 proven. 2356 refuted. 0 times theorem prover too weak. 64826 trivial. 0 not checked. [2024-10-13 17:44:25,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979594109] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:44:25,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:44:25,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 14] total 35 [2024-10-13 17:44:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455858918] [2024-10-13 17:44:25,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:44:25,232 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:44:25,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:44:25,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 17:44:25,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 17:44:25,233 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. cyclomatic complexity: 19 Second operand has 35 states, 26 states have (on average 3.0) internal successors, (78), 28 states have internal predecessors, (78), 12 states have call successors, (42), 9 states have call predecessors, (42), 10 states have return successors, (35), 9 states have call predecessors, (35), 12 states have call successors, (35) [2024-10-13 17:44:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:44:25,629 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-10-13 17:44:25,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 85 transitions. [2024-10-13 17:44:25,630 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-13 17:44:25,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 85 transitions. [2024-10-13 17:44:25,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2024-10-13 17:44:25,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2024-10-13 17:44:25,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2024-10-13 17:44:25,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:44:25,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-10-13 17:44:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2024-10-13 17:44:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-13 17:44:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 13 states have call successors, (13), 4 states have call predecessors, (13), 15 states have return successors, (24), 20 states have call predecessors, (24), 13 states have call successors, (24) [2024-10-13 17:44:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-10-13 17:44:25,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-10-13 17:44:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 17:44:25,640 INFO L425 stractBuchiCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-10-13 17:44:25,644 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-13 17:44:25,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 85 transitions. [2024-10-13 17:44:25,645 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-13 17:44:25,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:44:25,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:44:25,656 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:44:25,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [240, 240, 192, 192, 192, 72, 72, 48, 48, 48, 48, 48, 48, 48, 48, 48, 30, 30, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-13 17:44:25,656 INFO L745 eck$LassoCheckResult]: Stem: 35468#$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); 35439#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 35433#L109-2 [2024-10-13 17:44:25,658 INFO L747 eck$LassoCheckResult]: Loop: 35433#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 35440#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35441#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35464#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 35465#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35443#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35483#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 35496#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35444#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35484#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 35495#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35446#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35486#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 35492#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35447#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35487#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 35488#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 35448#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 35430#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 35427#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 35435#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 35436#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 35434#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 35437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 35454#L25-1 assume true; 35466#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35467#L25-1 assume true; 35475#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35474#L25-1 assume true; 35473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35472#L25-1 assume true; 35471#func_to_recursive_line_28_to_28_0EXIT >#113#return; 35470#L25-1 assume true; 35469#func_to_recursive_line_28_to_28_0EXIT >#119#return; 35426#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 35428#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 35438#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 35450#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 35451#L41-1 assume true; 35452#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35459#L41-1 assume true; 35478#func_to_recursive_line_27_to_28_0EXIT >#121#return; 35477#L41-1 assume true; 35476#func_to_recursive_line_27_to_28_0EXIT >#125#return; 35463#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 35429#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35431#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 35453#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 35456#L61-1 assume true; 35457#func_to_recursive_line_26_to_27_0EXIT >#127#return; 35458#L61-1 assume true; 35479#func_to_recursive_line_26_to_27_0EXIT >#115#return; 35461#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 35445#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 35462#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 35460#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 35455#L81-1 assume true; 35442#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35449#L81-1 assume true; 35494#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35493#L81-1 assume true; 35491#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35490#L81-1 assume true; 35489#func_to_recursive_line_25_to_26_0EXIT >#117#return; 35485#L81-1 assume true; 35482#func_to_recursive_line_25_to_26_0EXIT >#123#return; 35481#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 35480#L114-2 assume !(main_~b~0#1 < 6); 35432#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 35433#L109-2 [2024-10-13 17:44:25,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:44:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 11 times [2024-10-13 17:44:25,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:44:25,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49165485] [2024-10-13 17:44:25,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:44:25,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:44:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:44:25,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:44:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:44:25,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:44:25,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:44:25,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2143905231, now seen corresponding path program 6 times [2024-10-13 17:44:25,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:44:25,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197885193] [2024-10-13 17:44:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:44:25,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:44:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:32,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:33,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-10-13 17:44:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:34,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 688 [2024-10-13 17:44:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:35,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1031 [2024-10-13 17:44:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1374 [2024-10-13 17:44:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1717 [2024-10-13 17:44:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 17:44:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 17:44:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 17:44:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 17:44:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:44:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 154623 backedges. 124 proven. 5093 refuted. 0 times theorem prover too weak. 149406 trivial. 0 not checked. [2024-10-13 17:44:38,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:44:38,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197885193] [2024-10-13 17:44:38,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197885193] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:44:38,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689148730] [2024-10-13 17:44:38,798 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 17:44:38,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:44:38,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:44:38,799 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-10-13 17:44:38,800 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-10-13 17:44:39,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-13 17:44:39,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:44:39,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 17:44:39,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:44:40,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 17:44:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 154623 backedges. 853 proven. 3 refuted. 0 times theorem prover too weak. 153767 trivial. 0 not checked. [2024-10-13 17:44:40,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:44:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 154623 backedges. 725 proven. 4 refuted. 0 times theorem prover too weak. 153894 trivial. 0 not checked. [2024-10-13 17:44:45,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689148730] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:44:45,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:44:45,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 10] total 37 [2024-10-13 17:44:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705370650] [2024-10-13 17:44:45,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:44:45,713 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:44:45,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:44:45,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-13 17:44:45,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 17:44:45,715 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. cyclomatic complexity: 19 Second operand has 37 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 30 states have internal predecessors, (72), 14 states have call successors, (34), 9 states have call predecessors, (34), 12 states have return successors, (30), 12 states have call predecessors, (30), 14 states have call successors, (30) [2024-10-13 17:44:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:44:46,450 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2024-10-13 17:44:46,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 89 transitions. [2024-10-13 17:44:46,451 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-13 17:44:46,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 89 transitions. [2024-10-13 17:44:46,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2024-10-13 17:44:46,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2024-10-13 17:44:46,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 89 transitions. [2024-10-13 17:44:46,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:44:46,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-10-13 17:44:46,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 89 transitions. [2024-10-13 17:44:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 17:44:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 48 states have internal predecessors, (50), 13 states have call successors, (13), 4 states have call predecessors, (13), 17 states have return successors, (26), 22 states have call predecessors, (26), 13 states have call successors, (26) [2024-10-13 17:44:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2024-10-13 17:44:46,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-10-13 17:44:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 17:44:46,464 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-10-13 17:44:46,464 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-13 17:44:46,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 89 transitions. [2024-10-13 17:44:46,465 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2024-10-13 17:44:46,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:44:46,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:44:46,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:44:46,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [576, 576, 480, 480, 480, 144, 144, 96, 96, 96, 96, 96, 96, 96, 72, 72, 48, 48, 48, 48, 48, 48, 48, 30, 30, 24, 24, 24, 24, 24, 24, 24, 6, 6, 6, 6, 6, 1, 1, 1] [2024-10-13 17:44:46,478 INFO L745 eck$LassoCheckResult]: Stem: 61032#$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); 61005#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 60997#L109-2 [2024-10-13 17:44:46,481 INFO L747 eck$LassoCheckResult]: Loop: 60997#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 61003#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 61004#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 61019#L81-1 assume true; 61006#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61013#L81-1 assume true; 61060#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61059#L81-1 assume true; 61058#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61056#L81-1 assume true; 61055#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61050#L81-1 assume true; 61048#func_to_recursive_line_25_to_26_0EXIT >#123#return; 61028#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 61029#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 61012#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 61019#L81-1 assume true; 61006#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61013#L81-1 assume true; 61060#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61059#L81-1 assume true; 61058#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61056#L81-1 assume true; 61055#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61050#L81-1 assume true; 61048#func_to_recursive_line_25_to_26_0EXIT >#123#return; 61053#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 61062#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 61007#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 61019#L81-1 assume true; 61006#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61013#L81-1 assume true; 61060#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61059#L81-1 assume true; 61058#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61056#L81-1 assume true; 61055#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61050#L81-1 assume true; 61048#func_to_recursive_line_25_to_26_0EXIT >#123#return; 61049#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 61061#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 61009#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 61019#L81-1 assume true; 61006#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61013#L81-1 assume true; 61060#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61059#L81-1 assume true; 61058#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61056#L81-1 assume true; 61055#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61050#L81-1 assume true; 61048#func_to_recursive_line_25_to_26_0EXIT >#123#return; 61051#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 61057#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 61010#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 61019#L81-1 assume true; 61006#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61013#L81-1 assume true; 61060#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61059#L81-1 assume true; 61058#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61056#L81-1 assume true; 61055#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61050#L81-1 assume true; 61048#func_to_recursive_line_25_to_26_0EXIT >#123#return; 61052#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 61054#L114-2 assume !!(main_~b~0#1 < 6);call write~int#3(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 61011#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~d.base, ~d.offset, 4); 60994#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~e.base, ~e.offset, 4); 60991#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~f.base, ~f.offset, 4); 60999#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 61000#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 60998#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#2(~f.base, ~f.offset, 4); 61001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 61018#L25-1 assume true; 61030#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61031#L25-1 assume true; 61064#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61063#L25-1 assume true; 61047#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61045#L25-1 assume true; 61043#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61042#L25-1 assume true; 61041#func_to_recursive_line_28_to_28_0EXIT >#113#return; 61035#L25-1 assume true; 61034#func_to_recursive_line_28_to_28_0EXIT >#119#return; 60990#L47-1 call #t~mem8 := read~int#1(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 60992#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 61002#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#1(~e.base, ~e.offset, 4); 61014#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 61015#L41-1 assume true; 61016#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61023#L41-1 assume true; 61040#func_to_recursive_line_27_to_28_0EXIT >#121#return; 61037#L41-1 assume true; 61036#func_to_recursive_line_27_to_28_0EXIT >#125#return; 61027#L67-1 call #t~mem11 := read~int#4(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 60993#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 60995#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#4(~d.base, ~d.offset, 4); 61017#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 61020#L61-1 assume true; 61021#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61022#L61-1 assume true; 61033#func_to_recursive_line_26_to_27_0EXIT >#127#return; 61039#L61-1 assume true; 61038#func_to_recursive_line_26_to_27_0EXIT >#115#return; 61025#L87-1 call #t~mem14 := read~int#3(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 61008#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 61026#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#3(~c.base, ~c.offset, 4); 61024#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 61019#L81-1 assume true; 61006#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61013#L81-1 assume true; 61060#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61059#L81-1 assume true; 61058#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61056#L81-1 assume true; 61055#func_to_recursive_line_25_to_26_0EXIT >#117#return; 61050#L81-1 assume true; 61048#func_to_recursive_line_25_to_26_0EXIT >#123#return; 61046#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 61044#L114-2 assume !(main_~b~0#1 < 6); 60996#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 60997#L109-2 [2024-10-13 17:44:46,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:44:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 12 times [2024-10-13 17:44:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:44:46,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581022803] [2024-10-13 17:44:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:44:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:44:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:44:46,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:44:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:44:46,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:44:46,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:44:46,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1140356943, now seen corresponding path program 7 times [2024-10-13 17:44:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:44:46,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065974203] [2024-10-13 17:44:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:44:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:44:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat